java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 17:28:42,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 17:28:42,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 17:28:42,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 17:28:42,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 17:28:42,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 17:28:42,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 17:28:42,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 17:28:42,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 17:28:42,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 17:28:42,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 17:28:42,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 17:28:42,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 17:28:42,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 17:28:42,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 17:28:42,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 17:28:42,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 17:28:42,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 17:28:42,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 17:28:42,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 17:28:42,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 17:28:42,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 17:28:42,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 17:28:42,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 17:28:42,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 17:28:42,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 17:28:42,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 17:28:42,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 17:28:42,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 17:28:42,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 17:28:42,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 17:28:42,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 17:28:42,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 17:28:42,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 17:28:42,786 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 17:28:42,786 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 17:28:42,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 17:28:42,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 17:28:42,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 17:28:42,787 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 17:28:42,788 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 17:28:42,788 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 17:28:42,788 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 17:28:42,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 17:28:42,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 17:28:42,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 17:28:42,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 17:28:42,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 17:28:42,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 17:28:42,790 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 17:28:42,790 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 17:28:42,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 17:28:42,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 17:28:42,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 17:28:42,791 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 17:28:42,791 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 17:28:42,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 17:28:42,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 17:28:42,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 17:28:42,792 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 17:28:42,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 17:28:42,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 17:28:42,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 17:28:42,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:42,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 17:28:42,794 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 17:28:42,794 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 17:28:42,794 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 17:28:42,794 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 17:28:42,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 17:28:42,866 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 17:28:42,871 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 17:28:42,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 17:28:42,876 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 17:28:42,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,199 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc3054e8ea [2018-04-05 17:28:43,443 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 17:28:43,443 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 17:28:43,444 INFO L168 CDTParser]: Scanning list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,455 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 17:28:43,456 INFO L215 ultiparseSymbolTable]: [2018-04-05 17:28:43,456 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 17:28:43,456 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit ('exit') in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,456 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,456 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fd_mask in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____loff_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____WAIT_STATUS in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____sigset_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ino_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____pid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,457 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__suseconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ino64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_long in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_barrier_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____off_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ushort in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_condattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__loff_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__clock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____daddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____clock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____gid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__clockid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__daddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fd_mask in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_once_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsblkcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_attr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____pthread_list_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_char in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____caddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_short in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____off64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ulong in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__gid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__lldiv_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__wchar_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____socklen_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__uid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__List in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____mode_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__blksize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_char in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_spinlock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__div_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__blkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_long in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____clockid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__off_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____intptr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_cond_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__size_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsfilcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_mutex_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____rlim_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____timer_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__caddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_short in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__mode_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsfilcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____time_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____suseconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blkcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fd_set in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsblkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ssize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____nlink_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____qaddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____rlim64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____dev_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,468 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blksize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,470 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__timer_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____id_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____sig_atomic_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__register_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,471 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__sigset_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____swblk_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__nlink_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__uint in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ssize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____useconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__id_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsfilcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ldiv_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_int in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ino_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__dev_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsblkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__time_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_rwlock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:43,496 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc3054e8ea [2018-04-05 17:28:43,501 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 17:28:43,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 17:28:43,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 17:28:43,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 17:28:43,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 17:28:43,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1938349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43, skipping insertion in model container [2018-04-05 17:28:43,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,530 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:28:43,566 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:28:43,765 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:28:43,853 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:28:43,863 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-05 17:28:43,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43 WrapperNode [2018-04-05 17:28:43,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 17:28:43,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 17:28:43,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 17:28:43,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 17:28:43,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:43,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... [2018-04-05 17:28:44,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 17:28:44,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 17:28:44,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 17:28:44,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 17:28:44,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 17:28:44,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 17:28:44,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 17:28:44,160 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit [2018-04-05 17:28:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 17:28:44,161 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 17:28:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 17:28:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 17:28:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 17:28:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 17:28:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 17:28:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 17:28:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 17:28:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 17:28:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 17:28:44,167 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 17:28:44,168 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 17:28:44,169 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 17:28:44,170 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 17:28:44,170 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 17:28:44,170 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 17:28:44,171 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 17:28:44,172 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 17:28:44,173 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 17:28:44,174 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 17:28:44,175 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 17:28:44,176 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 17:28:44,177 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 17:28:44,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 17:28:44,180 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-05 17:28:44,180 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-05 17:28:44,181 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 17:28:44,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 17:28:44,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 17:28:44,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 17:28:44,181 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 17:28:45,007 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 17:28:45,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:28:45 BoogieIcfgContainer [2018-04-05 17:28:45,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 17:28:45,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 17:28:45,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 17:28:45,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 17:28:45,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:28:43" (1/3) ... [2018-04-05 17:28:45,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bcbec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:28:45, skipping insertion in model container [2018-04-05 17:28:45,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:28:43" (2/3) ... [2018-04-05 17:28:45,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bcbec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:28:45, skipping insertion in model container [2018-04-05 17:28:45,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:28:45" (3/3) ... [2018-04-05 17:28:45,016 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-04-05 17:28:45,024 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 17:28:45,031 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-05 17:28:45,085 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 17:28:45,086 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 17:28:45,086 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 17:28:45,087 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 17:28:45,087 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 17:28:45,087 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 17:28:45,087 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 17:28:45,087 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 17:28:45,088 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 17:28:45,088 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 17:28:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2018-04-05 17:28:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-05 17:28:45,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:45,119 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:45,120 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 432712272, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:45,138 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:45,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:45,211 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:45,223 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-05 17:28:45,255 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:45,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 17:28:45,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-05 17:28:45,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-05 17:28:45,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 17:28:45,270 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 2 states. [2018-04-05 17:28:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:45,311 INFO L93 Difference]: Finished difference Result 248 states and 271 transitions. [2018-04-05 17:28:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-05 17:28:45,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-04-05 17:28:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:45,322 INFO L225 Difference]: With dead ends: 248 [2018-04-05 17:28:45,322 INFO L226 Difference]: Without dead ends: 135 [2018-04-05 17:28:45,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-05 17:28:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-05 17:28:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-04-05 17:28:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-05 17:28:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-04-05 17:28:45,369 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 16 [2018-04-05 17:28:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:45,370 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-04-05 17:28:45,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-05 17:28:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-04-05 17:28:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-05 17:28:45,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:45,372 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:45,372 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash -595982304, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:45,385 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:45,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:45,424 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-05 17:28:45,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:45,442 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-05 17:28:45,464 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:45,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:28:45,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 17:28:45,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 17:28:45,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 17:28:45,468 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 3 states. [2018-04-05 17:28:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:45,494 INFO L93 Difference]: Finished difference Result 258 states and 271 transitions. [2018-04-05 17:28:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 17:28:45,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-05 17:28:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:45,497 INFO L225 Difference]: With dead ends: 258 [2018-04-05 17:28:45,497 INFO L226 Difference]: Without dead ends: 136 [2018-04-05 17:28:45,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-05 17:28:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-05 17:28:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-04-05 17:28:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-05 17:28:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-04-05 17:28:45,510 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 23 [2018-04-05 17:28:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:45,510 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-04-05 17:28:45,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 17:28:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-04-05 17:28:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 17:28:45,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:45,511 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-05 17:28:45,511 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1845378205, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:45,519 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:45,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:45,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 6 treesize of output 5 [2018-04-05 17:28:45,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:45,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:45,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:28:45,718 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-05 17:28:45,718 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:45,770 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-05 17:28:45,807 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:45,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-05 17:28:45,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:28:45,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:28:45,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:28:45,808 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 5 states. [2018-04-05 17:28:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:46,383 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-04-05 17:28:46,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 17:28:46,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-05 17:28:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:46,385 INFO L225 Difference]: With dead ends: 199 [2018-04-05 17:28:46,385 INFO L226 Difference]: Without dead ends: 183 [2018-04-05 17:28:46,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:28:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-05 17:28:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2018-04-05 17:28:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-05 17:28:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-04-05 17:28:46,401 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 25 [2018-04-05 17:28:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:46,401 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-04-05 17:28:46,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:28:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-04-05 17:28:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 17:28:46,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:46,403 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-05 17:28:46,403 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1845378204, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:46,412 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:46,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:46,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:46,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:46,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:46,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:28:46,589 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-05 17:28:46,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:46,745 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-05 17:28:46,782 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:46,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-05 17:28:46,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-05 17:28:46,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-05 17:28:46,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-05 17:28:46,783 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 8 states. [2018-04-05 17:28:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:47,277 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2018-04-05 17:28:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 17:28:47,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-05 17:28:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:47,280 INFO L225 Difference]: With dead ends: 230 [2018-04-05 17:28:47,280 INFO L226 Difference]: Without dead ends: 214 [2018-04-05 17:28:47,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-05 17:28:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-05 17:28:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-04-05 17:28:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-05 17:28:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-04-05 17:28:47,296 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 25 [2018-04-05 17:28:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:47,297 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-04-05 17:28:47,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-05 17:28:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-04-05 17:28:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-05 17:28:47,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:47,299 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:47,299 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:47,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1369408493, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:47,310 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:47,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:47,344 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:47,398 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:47,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-05 17:28:47,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:28:47,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:28:47,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:28:47,399 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 5 states. [2018-04-05 17:28:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:47,450 INFO L93 Difference]: Finished difference Result 411 states and 437 transitions. [2018-04-05 17:28:47,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:28:47,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-05 17:28:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:47,455 INFO L225 Difference]: With dead ends: 411 [2018-04-05 17:28:47,455 INFO L226 Difference]: Without dead ends: 273 [2018-04-05 17:28:47,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:28:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-05 17:28:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 193. [2018-04-05 17:28:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-05 17:28:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2018-04-05 17:28:47,475 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 41 [2018-04-05 17:28:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:47,476 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-04-05 17:28:47,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:28:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2018-04-05 17:28:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-05 17:28:47,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:47,478 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:47,478 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1671031696, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:47,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:47,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:47,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:47,560 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:47,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-05 17:28:47,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:28:47,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:28:47,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:28:47,561 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand 5 states. [2018-04-05 17:28:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:47,593 INFO L93 Difference]: Finished difference Result 382 states and 406 transitions. [2018-04-05 17:28:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:28:47,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-05 17:28:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:47,594 INFO L225 Difference]: With dead ends: 382 [2018-04-05 17:28:47,594 INFO L226 Difference]: Without dead ends: 252 [2018-04-05 17:28:47,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:28:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-05 17:28:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 196. [2018-04-05 17:28:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-05 17:28:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2018-04-05 17:28:47,605 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 43 [2018-04-05 17:28:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:47,605 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2018-04-05 17:28:47,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:28:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2018-04-05 17:28:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-05 17:28:47,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:47,607 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-05 17:28:47,607 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1758789338, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:47,617 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:47,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:47,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 6 treesize of output 5 [2018-04-05 17:28:47,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:28:47,672 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-05 17:28:47,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:47,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,679 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-05 17:28:47,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-05 17:28:47,686 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-05 17:28:47,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 5 [2018-04-05 17:28:47,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:47,691 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-05 17:28:47,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-05 17:28:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:47,704 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:47,739 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:47,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 17:28:47,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 17:28:47,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 17:28:47,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:28:47,740 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 7 states. [2018-04-05 17:28:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:48,120 INFO L93 Difference]: Finished difference Result 374 states and 398 transitions. [2018-04-05 17:28:48,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 17:28:48,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-04-05 17:28:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:48,122 INFO L225 Difference]: With dead ends: 374 [2018-04-05 17:28:48,122 INFO L226 Difference]: Without dead ends: 371 [2018-04-05 17:28:48,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:28:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-05 17:28:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 207. [2018-04-05 17:28:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-05 17:28:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 221 transitions. [2018-04-05 17:28:48,133 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 221 transitions. Word has length 44 [2018-04-05 17:28:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:48,134 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 221 transitions. [2018-04-05 17:28:48,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 17:28:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 221 transitions. [2018-04-05 17:28:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-05 17:28:48,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:48,135 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-05 17:28:48,135 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1758789337, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:48,145 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:48,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:48,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:48,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:28:48,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-05 17:28:48,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 17:28:48,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-05 17:28:48,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:48,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-05 17:28:48,241 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-05 17:28:48,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 5 [2018-04-05 17:28:48,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,254 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-05 17:28:48,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:48,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:48,261 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-05 17:28:48,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-05 17:28:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:48,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:48,396 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:48,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-05 17:28:48,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 17:28:48,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 17:28:48,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:28:48,397 INFO L87 Difference]: Start difference. First operand 207 states and 221 transitions. Second operand 12 states. [2018-04-05 17:28:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:49,100 INFO L93 Difference]: Finished difference Result 400 states and 423 transitions. [2018-04-05 17:28:49,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 17:28:49,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-05 17:28:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:49,103 INFO L225 Difference]: With dead ends: 400 [2018-04-05 17:28:49,103 INFO L226 Difference]: Without dead ends: 393 [2018-04-05 17:28:49,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-04-05 17:28:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-05 17:28:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 173. [2018-04-05 17:28:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-05 17:28:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-04-05 17:28:49,117 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 44 [2018-04-05 17:28:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:49,117 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-04-05 17:28:49,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 17:28:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-04-05 17:28:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-05 17:28:49,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:49,120 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:49,120 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1515306675, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:49,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:49,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:49,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 11 treesize of output 8 [2018-04-05 17:28:49,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 8 treesize of output 7 [2018-04-05 17:28:49,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-05 17:28:49,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-05 17:28:49,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:49,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,269 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-05 17:28:49,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-05 17:28:49,285 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-05 17:28:49,285 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:49,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-05 17:28:49,322 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 6 treesize of output 1 [2018-04-05 17:28:49,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,325 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 12 treesize of output 10 [2018-04-05 17:28:49,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-05 17:28:49,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:49,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:28:49,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-05 17:28:49,344 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-05 17:28:49,378 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:49,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-05 17:28:49,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:28:49,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:28:49,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:28:49,380 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 9 states. [2018-04-05 17:28:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:49,896 INFO L93 Difference]: Finished difference Result 486 states and 508 transitions. [2018-04-05 17:28:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 17:28:49,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-04-05 17:28:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:49,898 INFO L225 Difference]: With dead ends: 486 [2018-04-05 17:28:49,898 INFO L226 Difference]: Without dead ends: 414 [2018-04-05 17:28:49,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:28:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-05 17:28:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 226. [2018-04-05 17:28:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-05 17:28:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2018-04-05 17:28:49,912 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 45 [2018-04-05 17:28:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:49,913 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2018-04-05 17:28:49,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:28:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2018-04-05 17:28:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-05 17:28:49,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:49,914 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:49,914 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:49,915 INFO L82 PathProgramCache]: Analyzing trace with hash 195711792, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:49,922 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:49,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:49,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:50,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:50,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-04-05 17:28:50,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:28:50,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:28:50,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:28:50,044 INFO L87 Difference]: Start difference. First operand 226 states and 246 transitions. Second operand 9 states. [2018-04-05 17:28:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:50,136 INFO L93 Difference]: Finished difference Result 505 states and 558 transitions. [2018-04-05 17:28:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:28:50,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-04-05 17:28:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:50,139 INFO L225 Difference]: With dead ends: 505 [2018-04-05 17:28:50,139 INFO L226 Difference]: Without dead ends: 362 [2018-04-05 17:28:50,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:28:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-05 17:28:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2018-04-05 17:28:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-05 17:28:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 304 transitions. [2018-04-05 17:28:50,150 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 304 transitions. Word has length 47 [2018-04-05 17:28:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:50,150 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 304 transitions. [2018-04-05 17:28:50,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:28:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 304 transitions. [2018-04-05 17:28:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-05 17:28:50,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:50,151 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:50,151 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2077617878, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:50,163 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:50,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:50,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:28:50,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:50,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-05 17:28:50,261 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-05 17:28:50,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:50,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,266 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-05 17:28:50,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-05 17:28:50,291 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-05 17:28:50,291 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:50,435 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 7 treesize of output 5 [2018-04-05 17:28:50,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-05 17:28:50,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:50,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:28:50,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-04-05 17:28:50,459 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-05 17:28:50,494 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:50,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-04-05 17:28:50,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-05 17:28:50,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-05 17:28:50,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-05 17:28:50,495 INFO L87 Difference]: Start difference. First operand 274 states and 304 transitions. Second operand 8 states. [2018-04-05 17:28:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:51,818 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2018-04-05 17:28:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 17:28:51,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-04-05 17:28:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:51,821 INFO L225 Difference]: With dead ends: 413 [2018-04-05 17:28:51,821 INFO L226 Difference]: Without dead ends: 357 [2018-04-05 17:28:51,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-04-05 17:28:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-05 17:28:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 284. [2018-04-05 17:28:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-05 17:28:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 314 transitions. [2018-04-05 17:28:51,835 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 314 transitions. Word has length 49 [2018-04-05 17:28:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:51,836 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 314 transitions. [2018-04-05 17:28:51,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-05 17:28:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 314 transitions. [2018-04-05 17:28:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-05 17:28:51,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:51,837 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-05 17:28:51,837 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -361533683, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:51,845 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:51,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:51,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:51,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:28:51,892 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-05 17:28:51,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 17:28:51,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,902 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-05 17:28:51,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-05 17:28:51,911 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-05 17:28:51,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 5 [2018-04-05 17:28:51,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:51,919 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-05 17:28:51,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-05 17:28:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:51,936 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:51,978 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:51,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 17:28:51,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 17:28:51,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 17:28:51,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:28:51,979 INFO L87 Difference]: Start difference. First operand 284 states and 314 transitions. Second operand 7 states. [2018-04-05 17:28:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:52,284 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2018-04-05 17:28:52,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-05 17:28:52,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-04-05 17:28:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:52,286 INFO L225 Difference]: With dead ends: 352 [2018-04-05 17:28:52,286 INFO L226 Difference]: Without dead ends: 350 [2018-04-05 17:28:52,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:28:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-05 17:28:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 282. [2018-04-05 17:28:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-04-05 17:28:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 308 transitions. [2018-04-05 17:28:52,301 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 308 transitions. Word has length 49 [2018-04-05 17:28:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:52,302 INFO L459 AbstractCegarLoop]: Abstraction has 282 states and 308 transitions. [2018-04-05 17:28:52,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 17:28:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 308 transitions. [2018-04-05 17:28:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-05 17:28:52,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:52,303 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-05 17:28:52,303 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:52,303 INFO L82 PathProgramCache]: Analyzing trace with hash -361533682, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:52,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:52,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:52,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 17:28:52,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:28:52,380 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-05 17:28:52,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:52,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,398 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-05 17:28:52,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:52,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,411 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-05 17:28:52,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-05 17:28:52,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 21 treesize of output 17 [2018-04-05 17:28:52,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 17 treesize of output 5 [2018-04-05 17:28:52,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,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-05 17:28:52,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:28:52,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:52,445 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-05 17:28:52,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-05 17:28:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:52,471 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:52,563 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:52,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-05 17:28:52,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 17:28:52,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 17:28:52,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:28:52,564 INFO L87 Difference]: Start difference. First operand 282 states and 308 transitions. Second operand 12 states. [2018-04-05 17:28:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:52,904 INFO L93 Difference]: Finished difference Result 374 states and 404 transitions. [2018-04-05 17:28:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:28:52,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-04-05 17:28:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:52,922 INFO L225 Difference]: With dead ends: 374 [2018-04-05 17:28:52,922 INFO L226 Difference]: Without dead ends: 370 [2018-04-05 17:28:52,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:28:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-05 17:28:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 275. [2018-04-05 17:28:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-05 17:28:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2018-04-05 17:28:52,933 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 49 [2018-04-05 17:28:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:52,933 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2018-04-05 17:28:52,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 17:28:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2018-04-05 17:28:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 17:28:52,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:52,934 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:52,934 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash 611279802, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:52,945 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:52,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:52,992 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-05 17:28:52,993 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:53,008 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-05 17:28:53,030 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:28:53,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 17:28:53,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:28:53,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:28:53,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:28:53,031 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 6 states. [2018-04-05 17:28:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:53,136 INFO L93 Difference]: Finished difference Result 368 states and 387 transitions. [2018-04-05 17:28:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 17:28:53,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-05 17:28:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:53,138 INFO L225 Difference]: With dead ends: 368 [2018-04-05 17:28:53,139 INFO L226 Difference]: Without dead ends: 317 [2018-04-05 17:28:53,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:28:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-05 17:28:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 262. [2018-04-05 17:28:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-05 17:28:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2018-04-05 17:28:53,152 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 54 [2018-04-05 17:28:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:53,152 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2018-04-05 17:28:53,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:28:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2018-04-05 17:28:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-05 17:28:53,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:53,154 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:53,154 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1441379827, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:53,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:53,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:53,209 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:53,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:53,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-04-05 17:28:53,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:28:53,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:28:53,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:28:53,254 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 9 states. [2018-04-05 17:28:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:53,322 INFO L93 Difference]: Finished difference Result 640 states and 676 transitions. [2018-04-05 17:28:53,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:28:53,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-04-05 17:28:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:53,325 INFO L225 Difference]: With dead ends: 640 [2018-04-05 17:28:53,325 INFO L226 Difference]: Without dead ends: 487 [2018-04-05 17:28:53,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:28:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-04-05 17:28:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 297. [2018-04-05 17:28:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-05 17:28:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 312 transitions. [2018-04-05 17:28:53,339 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 312 transitions. Word has length 62 [2018-04-05 17:28:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:53,339 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 312 transitions. [2018-04-05 17:28:53,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:28:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 312 transitions. [2018-04-05 17:28:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-05 17:28:53,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:53,341 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:53,341 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1006468342, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:53,350 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:53,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:53,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:53,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-05 17:28:53,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:28:53,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:53,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,475 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-05 17:28:53,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-05 17:28:53,582 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-05 17:28:53,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:53,587 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-05 17:28:53,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:53,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-04-05 17:28:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:53,678 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:53,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-05 17:28:53,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 5 [2018-04-05 17:28:53,771 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-05 17:28:53,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:53,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-05 17:28:53,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:66 [2018-04-05 17:28:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:54,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:54,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-04-05 17:28:54,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-05 17:28:54,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-05 17:28:54,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:28:54,036 INFO L87 Difference]: Start difference. First operand 297 states and 312 transitions. Second operand 20 states. [2018-04-05 17:28:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:54,792 INFO L93 Difference]: Finished difference Result 407 states and 425 transitions. [2018-04-05 17:28:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-05 17:28:54,793 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-04-05 17:28:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:54,794 INFO L225 Difference]: With dead ends: 407 [2018-04-05 17:28:54,795 INFO L226 Difference]: Without dead ends: 406 [2018-04-05 17:28:54,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2018-04-05 17:28:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-05 17:28:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 323. [2018-04-05 17:28:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-05 17:28:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 341 transitions. [2018-04-05 17:28:54,811 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 341 transitions. Word has length 64 [2018-04-05 17:28:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:54,811 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 341 transitions. [2018-04-05 17:28:54,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-05 17:28:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 341 transitions. [2018-04-05 17:28:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-05 17:28:54,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:54,813 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:54,813 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1006468343, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:54,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:54,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:54,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-04-05 17:28:54,908 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-05 17:28:54,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:54,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,924 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-05 17:28:54,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 17:28:54,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:54,936 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-05 17:28:54,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2018-04-05 17:28:55,070 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-05 17:28:55,073 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:55,073 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-05 17:28:55,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,115 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-05 17:28:55,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:55,117 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-05 17:28:55,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,130 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-05 17:28:55,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:9 [2018-04-05 17:28:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:55,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:55,482 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 33 treesize of output 31 [2018-04-05 17:28:55,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-05 17:28:55,484 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-05 17:28:55,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:55,492 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 27 [2018-04-05 17:28:55,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, 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-05 17:28:55,494 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-05 17:28:55,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:55,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-04-05 17:28:55,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-05 17:28:55,504 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-05 17:28:55,509 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-05 17:28:55,555 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 23 treesize of output 21 [2018-04-05 17:28:55,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:55,557 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,561 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 21 [2018-04-05 17:28:55,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:55,563 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,566 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,567 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 25 [2018-04-05 17:28:55,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, 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-05 17:28:55,570 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,573 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:28:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:28:55,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,612 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:28:55,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-05 17:28:55,615 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,618 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:55,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:28:55,645 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:73, output treesize:42 [2018-04-05 17:28:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:55,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:55,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-05 17:28:55,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-05 17:28:55,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-05 17:28:55,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-05 17:28:55,827 INFO L87 Difference]: Start difference. First operand 323 states and 341 transitions. Second operand 22 states. [2018-04-05 17:28:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:56,813 INFO L93 Difference]: Finished difference Result 453 states and 473 transitions. [2018-04-05 17:28:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:28:56,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-04-05 17:28:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:56,815 INFO L225 Difference]: With dead ends: 453 [2018-04-05 17:28:56,815 INFO L226 Difference]: Without dead ends: 450 [2018-04-05 17:28:56,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2018-04-05 17:28:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-04-05 17:28:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 328. [2018-04-05 17:28:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-05 17:28:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 347 transitions. [2018-04-05 17:28:56,831 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 347 transitions. Word has length 64 [2018-04-05 17:28:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:56,831 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 347 transitions. [2018-04-05 17:28:56,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-05 17:28:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 347 transitions. [2018-04-05 17:28:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-05 17:28:56,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:56,833 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:56,833 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1838397429, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:56,841 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:56,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:56,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 6 treesize of output 5 [2018-04-05 17:28:56,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:56,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:56,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-05 17:28:56,917 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-05 17:28:56,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:56,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:56,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:56,927 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-05 17:28:56,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-05 17:28:57,088 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-05 17:28:57,096 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:57,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, 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-05 17:28:57,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:57,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:57,125 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-05 17:28:57,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-04-05 17:28:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:57,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:57,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-05 17:28:57,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-04-05 17:28:57,261 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-05 17:28:57,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:57,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-05 17:28:57,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:66 [2018-04-05 17:28:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:57,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:57,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-04-05 17:28:57,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-05 17:28:57,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-05 17:28:57,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:28:57,520 INFO L87 Difference]: Start difference. First operand 328 states and 347 transitions. Second operand 20 states. [2018-04-05 17:28:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:58,125 INFO L93 Difference]: Finished difference Result 408 states and 427 transitions. [2018-04-05 17:28:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-05 17:28:58,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-04-05 17:28:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:58,145 INFO L225 Difference]: With dead ends: 408 [2018-04-05 17:28:58,145 INFO L226 Difference]: Without dead ends: 407 [2018-04-05 17:28:58,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2018-04-05 17:28:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-05 17:28:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 350. [2018-04-05 17:28:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-05 17:28:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 370 transitions. [2018-04-05 17:28:58,154 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 370 transitions. Word has length 68 [2018-04-05 17:28:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:58,155 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 370 transitions. [2018-04-05 17:28:58,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-05 17:28:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 370 transitions. [2018-04-05 17:28:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-05 17:28:58,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:58,156 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:58,156 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1838397430, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:58,165 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:58,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:58,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:58,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-04-05 17:28:58,267 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-05 17:28:58,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:58,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,282 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-05 17:28:58,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:58,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,293 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-05 17:28:58,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2018-04-05 17:28:58,371 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-05 17:28:58,381 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:58,382 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-05 17:28:58,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,395 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-05 17:28:58,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:28:58,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-05 17:28:58,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,408 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-05 17:28:58,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:9 [2018-04-05 17:28:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:58,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:58,635 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 33 treesize of output 31 [2018-04-05 17:28:58,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-05 17:28:58,640 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-05 17:28:58,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:58,649 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 27 [2018-04-05 17:28:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-05 17:28:58,653 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-05 17:28:58,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:28:58,673 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 29 treesize of output 27 [2018-04-05 17:28:58,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-05 17:28:58,675 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-05 17:28:58,680 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-05 17:28:58,728 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 21 [2018-04-05 17:28:58,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, 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-05 17:28:58,730 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,735 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 23 treesize of output 21 [2018-04-05 17:28:58,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:28:58,736 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,740 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,741 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 25 [2018-04-05 17:28:58,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:28:58,743 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,746 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:28:58,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:28:58,783 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,794 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:28:58,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-05 17:28:58,797 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,801 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:58,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:28:58,828 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:73, output treesize:42 [2018-04-05 17:28:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:28:58,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:28:58,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-05 17:28:58,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-05 17:28:58,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-05 17:28:58,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-05 17:28:58,973 INFO L87 Difference]: Start difference. First operand 350 states and 370 transitions. Second operand 22 states. [2018-04-05 17:28:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:28:59,618 INFO L93 Difference]: Finished difference Result 443 states and 463 transitions. [2018-04-05 17:28:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:28:59,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-04-05 17:28:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:28:59,619 INFO L225 Difference]: With dead ends: 443 [2018-04-05 17:28:59,619 INFO L226 Difference]: Without dead ends: 441 [2018-04-05 17:28:59,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2018-04-05 17:28:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-04-05 17:28:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 348. [2018-04-05 17:28:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-05 17:28:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2018-04-05 17:28:59,632 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 68 [2018-04-05 17:28:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:28:59,632 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2018-04-05 17:28:59,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-05 17:28:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2018-04-05 17:28:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-05 17:28:59,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:28:59,634 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:28:59,634 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:28:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 153277337, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:28:59,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:28:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:28:59,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:28:59,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:28:59,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:28:59,680 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-05 17:28:59,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 8 treesize of output 7 [2018-04-05 17:28:59,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-05 17:28:59,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:28:59,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:28:59,709 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-05 17:28:59,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-05 17:28:59,741 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-05 17:28:59,743 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-05 17:28:59,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,750 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-05 17:28:59,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-05 17:28:59,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-05 17:28:59,764 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-05 17:28:59,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-05 17:28:59,794 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-05 17:28:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-05 17:28:59,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,805 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-05 17:28:59,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-05 17:28:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:28:59,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:28:59,956 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 12 treesize of output 10 [2018-04-05 17:28:59,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-05 17:28:59,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,959 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 12 treesize of output 10 [2018-04-05 17:28:59,961 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 6 treesize of output 1 [2018-04-05 17:28:59,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:28:59,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:28:59,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2018-04-05 17:29:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:00,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:00,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-04-05 17:29:00,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-05 17:29:00,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-05 17:29:00,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:29:00,027 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand 20 states. [2018-04-05 17:29:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:00,842 INFO L93 Difference]: Finished difference Result 630 states and 657 transitions. [2018-04-05 17:29:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-05 17:29:00,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-04-05 17:29:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:00,844 INFO L225 Difference]: With dead ends: 630 [2018-04-05 17:29:00,844 INFO L226 Difference]: Without dead ends: 566 [2018-04-05 17:29:00,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2018-04-05 17:29:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-05 17:29:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 376. [2018-04-05 17:29:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-05 17:29:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 395 transitions. [2018-04-05 17:29:00,855 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 395 transitions. Word has length 68 [2018-04-05 17:29:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:00,855 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 395 transitions. [2018-04-05 17:29:00,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-05 17:29:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 395 transitions. [2018-04-05 17:29:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-05 17:29:00,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:00,856 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:00,856 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1681672388, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:00,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:00,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:00,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-05 17:29:00,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:00,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-05 17:29:00,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:00,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,931 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-05 17:29:00,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-05 17:29:00,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-05 17:29:00,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:00,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:00,994 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-05 17:29:00,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-04-05 17:29:01,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-05 17:29:01,037 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:01,038 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-05 17:29:01,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,050 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-05 17:29:01,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:01,052 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-05 17:29:01,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,061 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-05 17:29:01,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:7 [2018-04-05 17:29:01,080 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-05 17:29:01,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:29:01,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,085 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-05 17:29:01,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-05 17:29:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:01,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:01,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-05 17:29:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-04-05 17:29:01,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,220 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 30 treesize of output 22 [2018-04-05 17:29:01,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-04-05 17:29:01,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:29:01,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-04-05 17:29:01,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:01,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:01,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:01,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:01,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:01,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:01,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:01,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:01,399 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:01,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:01,419 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:53, output treesize:24 [2018-04-05 17:29:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:01,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:01,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-04-05 17:29:01,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-05 17:29:01,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-05 17:29:01,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-04-05 17:29:01,537 INFO L87 Difference]: Start difference. First operand 376 states and 395 transitions. Second operand 25 states. [2018-04-05 17:29:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:02,492 INFO L93 Difference]: Finished difference Result 536 states and 559 transitions. [2018-04-05 17:29:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-05 17:29:02,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-04-05 17:29:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:02,494 INFO L225 Difference]: With dead ends: 536 [2018-04-05 17:29:02,494 INFO L226 Difference]: Without dead ends: 464 [2018-04-05 17:29:02,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2018-04-05 17:29:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-05 17:29:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 376. [2018-04-05 17:29:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-05 17:29:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 394 transitions. [2018-04-05 17:29:02,511 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 394 transitions. Word has length 74 [2018-04-05 17:29:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:02,512 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 394 transitions. [2018-04-05 17:29:02,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-05 17:29:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 394 transitions. [2018-04-05 17:29:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-05 17:29:02,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:02,513 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:02,513 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash 999341851, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:02,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:02,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:02,573 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-05 17:29:02,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:02,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,584 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-05 17:29:02,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 10 treesize of output 9 [2018-04-05 17:29:02,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,594 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-05 17:29:02,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-05 17:29:02,623 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 29 treesize of output 20 [2018-04-05 17:29:02,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:02,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,631 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-05 17:29:02,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-04-05 17:29:02,684 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-05 17:29:02,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:02,686 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-05 17:29:02,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,738 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-05 17:29:02,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:02,741 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-05 17:29:02,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,751 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-05 17:29:02,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:7 [2018-04-05 17:29:02,767 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-05 17:29:02,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:29:02,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,770 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-05 17:29:02,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-05 17:29:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:02,790 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:02,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-05 17:29:02,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-05 17:29:02,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,876 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 30 treesize of output 22 [2018-04-05 17:29:02,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-04-05 17:29:02,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:02,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:29:02,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-04-05 17:29:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:03,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:03,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 7 treesize of output 3 [2018-04-05 17:29:03,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:03,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:03,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,252 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:03,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:03,255 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:03,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:03,277 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:53, output treesize:24 [2018-04-05 17:29:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:03,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:03,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-04-05 17:29:03,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-05 17:29:03,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-05 17:29:03,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-04-05 17:29:03,391 INFO L87 Difference]: Start difference. First operand 376 states and 394 transitions. Second operand 25 states. [2018-04-05 17:29:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:04,071 INFO L93 Difference]: Finished difference Result 496 states and 516 transitions. [2018-04-05 17:29:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:29:04,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-04-05 17:29:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:04,073 INFO L225 Difference]: With dead ends: 496 [2018-04-05 17:29:04,073 INFO L226 Difference]: Without dead ends: 440 [2018-04-05 17:29:04,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2018-04-05 17:29:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-05 17:29:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 379. [2018-04-05 17:29:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-05 17:29:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 397 transitions. [2018-04-05 17:29:04,086 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 397 transitions. Word has length 78 [2018-04-05 17:29:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:04,087 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 397 transitions. [2018-04-05 17:29:04,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-05 17:29:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 397 transitions. [2018-04-05 17:29:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-05 17:29:04,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:04,088 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:04,089 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1259764447, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:04,095 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:04,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:04,192 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-05 17:29:04,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:04,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,203 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-05 17:29:04,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 10 treesize of output 9 [2018-04-05 17:29:04,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-05 17:29:04,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, 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 20 [2018-04-05 17:29:04,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, 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-05 17:29:04,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,256 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-05 17:29:04,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-04-05 17:29:04,296 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-05 17:29:04,297 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:04,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-05 17:29:04,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,308 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-05 17:29:04,309 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:04,310 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-05 17:29:04,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,317 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-05 17:29:04,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:7 [2018-04-05 17:29:04,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, 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-05 17:29:04,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:29:04,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,336 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-05 17:29:04,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-05 17:29:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:04,358 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:04,446 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 11 [2018-04-05 17:29:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-05 17:29:04,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:29:04,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-05 17:29:04,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:04,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:04,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:04,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:04,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:04,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:04,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:04,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:29:04,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,614 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:04,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:04,634 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:53, output treesize:24 [2018-04-05 17:29:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:04,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:04,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2018-04-05 17:29:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-05 17:29:04,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-05 17:29:04,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-04-05 17:29:04,742 INFO L87 Difference]: Start difference. First operand 379 states and 397 transitions. Second operand 24 states. [2018-04-05 17:29:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:05,414 INFO L93 Difference]: Finished difference Result 491 states and 510 transitions. [2018-04-05 17:29:05,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:29:05,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-04-05 17:29:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:05,415 INFO L225 Difference]: With dead ends: 491 [2018-04-05 17:29:05,415 INFO L226 Difference]: Without dead ends: 435 [2018-04-05 17:29:05,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2018-04-05 17:29:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-05 17:29:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 376. [2018-04-05 17:29:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-05 17:29:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 393 transitions. [2018-04-05 17:29:05,432 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 393 transitions. Word has length 78 [2018-04-05 17:29:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:05,432 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 393 transitions. [2018-04-05 17:29:05,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-05 17:29:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 393 transitions. [2018-04-05 17:29:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-05 17:29:05,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:05,434 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:05,434 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1900743019, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:05,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:05,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-05 17:29:05,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-05 17:29:05,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:05,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 17:29:05,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 17:29:05,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 17:29:05,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-04-05 17:29:05,559 INFO L87 Difference]: Start difference. First operand 376 states and 393 transitions. Second operand 10 states. [2018-04-05 17:29:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:05,628 INFO L93 Difference]: Finished difference Result 494 states and 516 transitions. [2018-04-05 17:29:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 17:29:05,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-04-05 17:29:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:05,629 INFO L225 Difference]: With dead ends: 494 [2018-04-05 17:29:05,630 INFO L226 Difference]: Without dead ends: 430 [2018-04-05 17:29:05,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:29:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-05 17:29:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 371. [2018-04-05 17:29:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-05 17:29:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 392 transitions. [2018-04-05 17:29:05,642 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 392 transitions. Word has length 83 [2018-04-05 17:29:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:05,642 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 392 transitions. [2018-04-05 17:29:05,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 17:29:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 392 transitions. [2018-04-05 17:29:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-05 17:29:05,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:05,643 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:05,643 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -754846383, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:05,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:05,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-05 17:29:05,701 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-05 17:29:05,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:05,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 17:29:05,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 17:29:05,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 17:29:05,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-05 17:29:05,747 INFO L87 Difference]: Start difference. First operand 371 states and 392 transitions. Second operand 10 states. [2018-04-05 17:29:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:05,813 INFO L93 Difference]: Finished difference Result 551 states and 581 transitions. [2018-04-05 17:29:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 17:29:05,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-04-05 17:29:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:05,815 INFO L225 Difference]: With dead ends: 551 [2018-04-05 17:29:05,815 INFO L226 Difference]: Without dead ends: 487 [2018-04-05 17:29:05,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-05 17:29:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-04-05 17:29:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 366. [2018-04-05 17:29:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-05 17:29:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 393 transitions. [2018-04-05 17:29:05,825 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 393 transitions. Word has length 83 [2018-04-05 17:29:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:05,826 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 393 transitions. [2018-04-05 17:29:05,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 17:29:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 393 transitions. [2018-04-05 17:29:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-05 17:29:05,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:05,826 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:05,826 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1638822865, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:05,834 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:05,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:05,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:05,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:05,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:05,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:05,888 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-05 17:29:05,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-05 17:29:05,911 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-05 17:29:05,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, 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-05 17:29:05,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,920 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-05 17:29:05,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-05 17:29:05,972 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-05 17:29:05,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:05,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:06,006 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-05 17:29:06,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:31 [2018-04-05 17:29:06,102 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-05 17:29:06,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:06,106 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-05 17:29:06,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:06,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:06,154 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-05 17:29:06,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2018-04-05 17:29:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:06,220 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:06,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-05 17:29:06,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:06,333 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-05 17:29:06,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-05 17:29:06,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:29:06,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:06,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:06,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:06,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 19 treesize of output 11 [2018-04-05 17:29:06,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:07,002 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 11 treesize of output 7 [2018-04-05 17:29:07,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:07,008 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 16 treesize of output 11 [2018-04-05 17:29:07,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:07,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:29:07,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:07,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:07,014 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:07,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:07,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:29:07,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-05 17:29:07,048 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:46, output treesize:63 [2018-04-05 17:29:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:07,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:07,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-04-05 17:29:07,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-05 17:29:07,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-05 17:29:07,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:29:07,348 INFO L87 Difference]: Start difference. First operand 366 states and 393 transitions. Second operand 28 states. [2018-04-05 17:29:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:08,427 INFO L93 Difference]: Finished difference Result 517 states and 554 transitions. [2018-04-05 17:29:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-05 17:29:08,444 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-04-05 17:29:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:08,445 INFO L225 Difference]: With dead ends: 517 [2018-04-05 17:29:08,445 INFO L226 Difference]: Without dead ends: 516 [2018-04-05 17:29:08,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2018-04-05 17:29:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-05 17:29:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 395. [2018-04-05 17:29:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-05 17:29:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 425 transitions. [2018-04-05 17:29:08,457 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 425 transitions. Word has length 83 [2018-04-05 17:29:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:08,457 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 425 transitions. [2018-04-05 17:29:08,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-05 17:29:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 425 transitions. [2018-04-05 17:29:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-05 17:29:08,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:08,458 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:08,458 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1638822864, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:08,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:08,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:08,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:08,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:08,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:08,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:08,517 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-05 17:29:08,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:29:08,544 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-05 17:29:08,545 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-05 17:29:08,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,556 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-05 17:29:08,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:08,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,566 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-05 17:29:08,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-04-05 17:29:08,622 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 74 treesize of output 68 [2018-04-05 17:29:08,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:08,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-05 17:29:08,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:08,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,669 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-05 17:29:08,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:97, output treesize:40 [2018-04-05 17:29:08,733 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-05 17:29:08,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:08,736 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-05 17:29:08,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:29:08,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:08,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-05 17:29:08,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:08,761 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-05 17:29:08,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-05 17:29:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:08,811 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:08,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-04-05 17:29:08,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:08,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-04-05 17:29:08,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:09,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-05 17:29:09,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:101, output treesize:99 [2018-04-05 17:29:09,949 WARN L148 SmtUtils]: Spent 794ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-05 17:29:12,411 WARN L148 SmtUtils]: Spent 247ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-05 17:29:15,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:29:15,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:15,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:15,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:15,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:15,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:15,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:15,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:15,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-05 17:29:15,980 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,008 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 16 treesize of output 11 [2018-04-05 17:29:16,008 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,015 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 11 treesize of output 7 [2018-04-05 17:29:16,016 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:29:16,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:29:16,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-05 17:29:16,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 11 treesize of output 10 [2018-04-05 17:29:16,149 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-05 17:29:16,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:29:16,171 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,183 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 18 [2018-04-05 17:29:16,184 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:16,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:29:16,191 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,195 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:16,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:16,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:16,198 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,201 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,216 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:29:16,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:29:16,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:16,343 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:16,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-05 17:29:16,365 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,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, 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-05 17:29:16,373 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,391 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 16 treesize of output 16 [2018-04-05 17:29:16,392 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:16,398 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:16,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:16,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:16,403 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,413 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:16,427 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:29:16,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-04-05 17:29:16,573 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:156, output treesize:112 [2018-04-05 17:29:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:16,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:16,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-05 17:29:16,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-05 17:29:16,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-05 17:29:16,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=786, Unknown=2, NotChecked=0, Total=870 [2018-04-05 17:29:16,950 INFO L87 Difference]: Start difference. First operand 395 states and 425 transitions. Second operand 30 states. [2018-04-05 17:29:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:18,679 INFO L93 Difference]: Finished difference Result 532 states and 567 transitions. [2018-04-05 17:29:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-05 17:29:18,679 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2018-04-05 17:29:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:18,680 INFO L225 Difference]: With dead ends: 532 [2018-04-05 17:29:18,681 INFO L226 Difference]: Without dead ends: 531 [2018-04-05 17:29:18,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=409, Invalid=2039, Unknown=2, NotChecked=0, Total=2450 [2018-04-05 17:29:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-05 17:29:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 395. [2018-04-05 17:29:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-05 17:29:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 424 transitions. [2018-04-05 17:29:18,699 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 424 transitions. Word has length 83 [2018-04-05 17:29:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:18,700 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 424 transitions. [2018-04-05 17:29:18,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-05 17:29:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 424 transitions. [2018-04-05 17:29:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-05 17:29:18,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:18,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 17:29:18,702 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1050690678, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:18,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:18,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:18,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 17:29:18,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:18,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:18,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:18,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-05 17:29:18,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-05 17:29:18,791 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-05 17:29:18,793 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-05 17:29:18,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,800 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-05 17:29:18,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-05 17:29:18,850 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-05 17:29:18,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:18,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,865 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-05 17:29:18,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:31 [2018-04-05 17:29:18,941 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-05 17:29:18,944 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:18,944 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-05 17:29:18,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:18,955 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-05 17:29:18,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2018-04-05 17:29:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:19,000 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:19,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-05 17:29:19,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:19,075 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-05 17:29:19,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-05 17:29:22,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:29:22,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:22,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:22,331 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 19 treesize of output 15 [2018-04-05 17:29:22,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:29:22,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,348 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 16 treesize of output 11 [2018-04-05 17:29:22,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:29:22,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:22,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:22,355 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:22,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:29:22,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-05 17:29:22,395 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:46, output treesize:63 [2018-04-05 17:29:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:22,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:22,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-04-05 17:29:22,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-05 17:29:22,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-05 17:29:22,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=677, Unknown=1, NotChecked=0, Total=756 [2018-04-05 17:29:22,755 INFO L87 Difference]: Start difference. First operand 395 states and 424 transitions. Second operand 28 states. [2018-04-05 17:29:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:23,817 INFO L93 Difference]: Finished difference Result 502 states and 537 transitions. [2018-04-05 17:29:23,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-05 17:29:23,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-04-05 17:29:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:23,835 INFO L225 Difference]: With dead ends: 502 [2018-04-05 17:29:23,835 INFO L226 Difference]: Without dead ends: 501 [2018-04-05 17:29:23,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=351, Invalid=1718, Unknown=1, NotChecked=0, Total=2070 [2018-04-05 17:29:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-05 17:29:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 420. [2018-04-05 17:29:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-05 17:29:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 451 transitions. [2018-04-05 17:29:23,848 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 451 transitions. Word has length 87 [2018-04-05 17:29:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:23,848 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 451 transitions. [2018-04-05 17:29:23,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-05 17:29:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 451 transitions. [2018-04-05 17:29:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-05 17:29:23,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:23,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 17:29:23,849 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1050690679, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:23,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:23,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:23,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:23,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:23,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:23,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:23,916 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-05 17:29:23,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:29:23,944 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-05 17:29:23,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:23,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,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, 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-05 17:29:23,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-05 17:29:23,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:23,967 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-05 17:29:23,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-04-05 17:29:24,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-05 17:29:24,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-05 17:29:24,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,041 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 64 treesize of output 58 [2018-04-05 17:29:24,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:24,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,061 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-05 17:29:24,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:97, output treesize:40 [2018-04-05 17:29:24,128 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-05 17:29:24,130 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:24,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, 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-05 17:29:24,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:29:24,146 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:24,146 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-05 17:29:24,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,156 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-05 17:29:24,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-05 17:29:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:24,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:24,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 40 treesize of output 38 [2018-04-05 17:29:24,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:24,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-04-05 17:29:24,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:24,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-05 17:29:24,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:101, output treesize:99 [2018-04-05 17:29:28,616 WARN L148 SmtUtils]: Spent 4031ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-05 17:29:34,072 WARN L148 SmtUtils]: Spent 2140ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-05 17:29:38,899 WARN L148 SmtUtils]: Spent 429ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-05 17:29:38,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:29:38,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:38,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:38,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:38,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:38,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:38,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:38,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:38,982 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 16 treesize of output 11 [2018-04-05 17:29:38,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:38,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-05 17:29:38,996 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-05 17:29:39,004 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:29:39,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:29:39,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-05 17:29:39,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:39,110 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-05 17:29:39,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 17 [2018-04-05 17:29:39,134 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,147 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 18 [2018-04-05 17:29:39,147 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:39,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:29:39,155 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,163 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:39,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:39,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:39,167 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,171 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,187 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:29:39,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:29:39,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:39,326 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:39,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:39,345 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,347 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:39,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 15 [2018-04-05 17:29:39,355 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:29:39,364 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:39,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-04-05 17:29:39,376 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:39,380 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:39,396 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:29:39,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-04-05 17:29:39,552 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:156, output treesize:112 [2018-04-05 17:29:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:39,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:39,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-05 17:29:39,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-05 17:29:39,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-05 17:29:39,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=785, Unknown=3, NotChecked=0, Total=870 [2018-04-05 17:29:39,949 INFO L87 Difference]: Start difference. First operand 420 states and 451 transitions. Second operand 30 states. [2018-04-05 17:29:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:41,604 INFO L93 Difference]: Finished difference Result 506 states and 539 transitions. [2018-04-05 17:29:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-05 17:29:41,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-04-05 17:29:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:41,606 INFO L225 Difference]: With dead ends: 506 [2018-04-05 17:29:41,606 INFO L226 Difference]: Without dead ends: 505 [2018-04-05 17:29:41,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=409, Invalid=2038, Unknown=3, NotChecked=0, Total=2450 [2018-04-05 17:29:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-04-05 17:29:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 420. [2018-04-05 17:29:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-05 17:29:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 450 transitions. [2018-04-05 17:29:41,618 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 450 transitions. Word has length 87 [2018-04-05 17:29:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:41,619 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 450 transitions. [2018-04-05 17:29:41,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-05 17:29:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 450 transitions. [2018-04-05 17:29:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-05 17:29:41,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:41,620 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:41,620 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash 807931699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:41,625 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:41,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:41,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 17:29:41,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:41,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:41,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:41,684 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-05 17:29:41,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:29:41,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-05 17:29:41,716 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-05 17:29:41,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,729 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-05 17:29:41,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:41,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,744 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-05 17:29:41,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2018-04-05 17:29:41,819 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 74 treesize of output 68 [2018-04-05 17:29:41,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-05 17:29:41,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-05 17:29:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-05 17:29:41,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,862 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-05 17:29:41,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:95, output treesize:40 [2018-04-05 17:29:41,931 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-05 17:29:41,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:41,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, 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-05 17:29:41,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:29:41,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:41,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, 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-05 17:29:41,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:41,959 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-05 17:29:41,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-05 17:29:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:42,033 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:42,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2018-04-05 17:29:42,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:42,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-05 17:29:42,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:93 [2018-04-05 17:29:43,122 WARN L148 SmtUtils]: Spent 455ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-05 17:29:45,513 WARN L148 SmtUtils]: Spent 1603ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 17:29:52,932 WARN L148 SmtUtils]: Spent 2038ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-05 17:29:52,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2018-04-05 17:29:52,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:52,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:53,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:53,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:53,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:29:53,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:29:53,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-05 17:29:53,040 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:29:53,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:29:53,183 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-05 17:29:53,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 11 treesize of output 10 [2018-04-05 17:29:53,214 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-05 17:29:53,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:53,229 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-05 17:29:53,234 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,235 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,241 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-04-05 17:29:53,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:53,276 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:53,295 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-05 17:29:53,297 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,300 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,306 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-04-05 17:29:53,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:53,334 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:29:53,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-05 17:29:53,352 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,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, 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-05 17:29:53,363 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-05 17:29:53,372 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,374 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,380 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-05 17:29:53,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:53,411 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,435 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 20 treesize of output 19 [2018-04-05 17:29:53,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:53,437 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-05 17:29:53,441 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,442 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,448 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-04-05 17:29:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:53,475 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,485 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 10 treesize of output 8 [2018-04-05 17:29:53,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:53,487 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,488 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,495 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:29:53,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:29:53,585 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-05 17:29:53,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 13 [2018-04-05 17:29:53,611 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-04-05 17:29:53,624 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:53,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-04-05 17:29:53,633 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,638 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:29:53,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:29:53,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:29:53,641 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,644 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:53,660 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:29:53,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-05 17:29:53,762 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 10 variables, input treesize:179, output treesize:93 [2018-04-05 17:29:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:54,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:29:54,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-04-05 17:29:54,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-05 17:29:54,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-05 17:29:54,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1023, Unknown=2, NotChecked=0, Total=1122 [2018-04-05 17:29:54,181 INFO L87 Difference]: Start difference. First operand 420 states and 450 transitions. Second operand 34 states. [2018-04-05 17:29:55,175 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 24 DAG size of output 23 [2018-04-05 17:29:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:29:56,792 INFO L93 Difference]: Finished difference Result 555 states and 592 transitions. [2018-04-05 17:29:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-05 17:29:56,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-04-05 17:29:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:29:56,795 INFO L225 Difference]: With dead ends: 555 [2018-04-05 17:29:56,795 INFO L226 Difference]: Without dead ends: 552 [2018-04-05 17:29:56,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=498, Invalid=2806, Unknown=2, NotChecked=0, Total=3306 [2018-04-05 17:29:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-04-05 17:29:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 434. [2018-04-05 17:29:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-05 17:29:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 465 transitions. [2018-04-05 17:29:56,820 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 465 transitions. Word has length 89 [2018-04-05 17:29:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:29:56,820 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 465 transitions. [2018-04-05 17:29:56,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-05 17:29:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 465 transitions. [2018-04-05 17:29:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-05 17:29:56,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:29:56,822 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:29:56,822 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:29:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 813459354, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:29:56,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:29:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:29:56,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:29:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:56,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:56,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:56,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:29:57,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:57,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:29:57,016 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-05 17:29:57,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:29:57,060 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-05 17:29:57,062 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-05 17:29:57,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,077 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-05 17:29:57,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:29:57,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,090 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-05 17:29:57,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2018-04-05 17:29:57,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-05 17:29:57,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-05 17:29:57,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,203 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 64 treesize of output 58 [2018-04-05 17:29:57,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-05 17:29:57,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,225 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-05 17:29:57,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:95, output treesize:40 [2018-04-05 17:29:57,309 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-05 17:29:57,311 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:57,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-05 17:29:57,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:29:57,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:29:57,335 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-05 17:29:57,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:29:57,350 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-05 17:29:57,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-05 17:29:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:29:57,431 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:29:57,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2018-04-05 17:29:57,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:29:57,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-05 17:29:57,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:93 [2018-04-05 17:29:59,849 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-05 17:30:00,479 WARN L148 SmtUtils]: Spent 201ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 17:30:01,052 WARN L148 SmtUtils]: Spent 283ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 17:30:01,735 WARN L148 SmtUtils]: Spent 470ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-05 17:30:01,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2018-04-05 17:30:01,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:01,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:30:01,801 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 16 treesize of output 11 [2018-04-05 17:30:01,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,811 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 19 treesize of output 15 [2018-04-05 17:30:01,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,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 12 treesize of output 3 [2018-04-05 17:30:01,821 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:30:01,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:30:01,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:01,850 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:01,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:30:01,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-05 17:30:02,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,004 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-05 17:30:02,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-05 17:30:02,032 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 9 [2018-04-05 17:30:02,042 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,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, 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 18 [2018-04-05 17:30:02,055 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:02,059 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:30:02,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:30:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:02,063 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,066 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:30:02,229 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-05 17:30:02,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,257 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-05 17:30:02,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:30:02,272 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:02,277 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,278 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,284 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-04-05 17:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,313 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:30:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 15 [2018-04-05 17:30:02,332 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,341 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:02,342 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 16 treesize of output 11 [2018-04-05 17:30:02,342 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,345 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,351 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-04-05 17:30:02,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,377 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,388 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 10 treesize of output 8 [2018-04-05 17:30:02,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:02,390 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,391 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,398 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,401 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-05 17:30:02,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,427 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-05 17:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 17:30:02,440 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:02,444 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,445 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,451 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-04-05 17:30:02,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:02,478 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:30:02,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 15 [2018-04-05 17:30:02,513 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:30:02,617 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,710 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:02,724 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 16 treesize of output 11 [2018-04-05 17:30:02,725 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,748 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,801 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:02,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-05 17:30:02,896 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 10 variables, input treesize:179, output treesize:93 [2018-04-05 17:30:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:30:03,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:30:03,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-04-05 17:30:03,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-05 17:30:03,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-05 17:30:03,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-04-05 17:30:03,365 INFO L87 Difference]: Start difference. First operand 434 states and 465 transitions. Second operand 34 states. [2018-04-05 17:30:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:30:05,574 INFO L93 Difference]: Finished difference Result 518 states and 552 transitions. [2018-04-05 17:30:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-05 17:30:05,574 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2018-04-05 17:30:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:30:05,576 INFO L225 Difference]: With dead ends: 518 [2018-04-05 17:30:05,576 INFO L226 Difference]: Without dead ends: 517 [2018-04-05 17:30:05,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=498, Invalid=2808, Unknown=0, NotChecked=0, Total=3306 [2018-04-05 17:30:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-04-05 17:30:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 440. [2018-04-05 17:30:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-05 17:30:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 471 transitions. [2018-04-05 17:30:05,590 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 471 transitions. Word has length 93 [2018-04-05 17:30:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:30:05,591 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 471 transitions. [2018-04-05 17:30:05,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-05 17:30:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 471 transitions. [2018-04-05 17:30:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-05 17:30:05,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:30:05,592 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 17:30:05,592 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:30:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1300442315, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:30:05,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:30:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:30:05,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:30:05,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:05,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:30:05,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,665 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-05 17:30:05,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-05 17:30:05,700 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-05 17:30:05,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:05,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,715 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-05 17:30:05,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-05 17:30:05,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:39 [2018-04-05 17:30:05,784 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-05 17:30:05,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-05 17:30:05,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,805 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-05 17:30:05,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:73 [2018-04-05 17:30:05,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,826 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-05 17:30:05,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,837 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-05 17:30:05,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:71 [2018-04-05 17:30:05,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-04-05 17:30:05,877 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-05 17:30:05,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:05,906 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 42 treesize of output 49 [2018-04-05 17:30:05,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:05,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:05,928 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-05 17:30:05,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:83 [2018-04-05 17:30:06,007 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 67 treesize of output 74 [2018-04-05 17:30:06,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-05 17:30:06,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,024 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-05 17:30:06,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:114 [2018-04-05 17:30:06,122 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 114 treesize of output 89 [2018-04-05 17:30:06,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2018-04-05 17:30:06,125 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-05 17:30:06,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:06,134 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 41 treesize of output 29 [2018-04-05 17:30:06,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,142 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-05 17:30:06,155 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 23 treesize of output 19 [2018-04-05 17:30:06,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:06,157 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-05 17:30:06,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,170 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-05 17:30:06,170 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:135, output treesize:19 [2018-04-05 17:30:06,221 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-05 17:30:06,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-05 17:30:06,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:30:06,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,229 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-05 17:30:06,229 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-05 17:30:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:30:06,300 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:30:06,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-04-05 17:30:06,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2018-04-05 17:30:06,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,709 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 60 treesize of output 42 [2018-04-05 17:30:06,711 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 22 treesize of output 1 [2018-04-05 17:30:06,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:06,723 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 2 xjuncts. [2018-04-05 17:30:06,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:65 [2018-04-05 17:30:07,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-05 17:30:07,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:07,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:30:07,352 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 16 treesize of output 11 [2018-04-05 17:30:07,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-05 17:30:07,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,368 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 11 treesize of output 7 [2018-04-05 17:30:07,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:30:07,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:30:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:07,375 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:30:07,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-05 17:30:07,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:07,467 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:30:07,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 17:30:07,489 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:30:07,497 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-05 17:30:07,503 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,506 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:30:07,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:30:07,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:30:07,510 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,512 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:07,525 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:30:07,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 10 xjuncts. [2018-04-05 17:30:07,600 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:105, output treesize:192 [2018-04-05 17:30:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:30:08,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:30:08,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-04-05 17:30:08,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-05 17:30:08,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-05 17:30:08,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1481, Unknown=0, NotChecked=0, Total=1640 [2018-04-05 17:30:08,257 INFO L87 Difference]: Start difference. First operand 440 states and 471 transitions. Second operand 41 states. [2018-04-05 17:30:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:30:12,205 INFO L93 Difference]: Finished difference Result 759 states and 808 transitions. [2018-04-05 17:30:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-05 17:30:12,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 93 [2018-04-05 17:30:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:30:12,208 INFO L225 Difference]: With dead ends: 759 [2018-04-05 17:30:12,208 INFO L226 Difference]: Without dead ends: 674 [2018-04-05 17:30:12,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=839, Invalid=5967, Unknown=0, NotChecked=0, Total=6806 [2018-04-05 17:30:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-05 17:30:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 497. [2018-04-05 17:30:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-05 17:30:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 532 transitions. [2018-04-05 17:30:12,239 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 532 transitions. Word has length 93 [2018-04-05 17:30:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:30:12,240 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 532 transitions. [2018-04-05 17:30:12,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-05 17:30:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 532 transitions. [2018-04-05 17:30:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-05 17:30:12,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:30:12,241 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, 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-05 17:30:12,241 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:30:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1384752089, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:30:12,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:30:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:30:12,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:30:12,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:12,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:30:12,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:12,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:12,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, 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-05 17:30:12,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:30:12,390 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-05 17:30:12,391 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-05 17:30:12,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,407 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-05 17:30:12,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 17:30:12,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,420 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-05 17:30:12,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2018-04-05 17:30:12,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 17:30:12,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,511 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-05 17:30:12,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-04-05 17:30:12,566 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 61 treesize of output 55 [2018-04-05 17:30:12,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:12,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,593 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 44 treesize of output 45 [2018-04-05 17:30:12,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:30:12,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,618 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-05 17:30:12,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:96, output treesize:58 [2018-04-05 17:30:12,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-05 17:30:12,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:12,732 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 22 treesize of output 17 [2018-04-05 17:30:12,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,752 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-05 17:30:12,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:58 [2018-04-05 17:30:12,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:30:12,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:12,869 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 43 treesize of output 51 [2018-04-05 17:30:12,872 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:12,872 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 28 treesize of output 12 [2018-04-05 17:30:12,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:12,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, 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-05 17:30:12,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:30:12,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-05 17:30:12,891 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:67, output treesize:5 [2018-04-05 17:30:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:30:12,971 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:30:20,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2018-04-05 17:30:20,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:20,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 17:30:20,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:64 [2018-04-05 17:30:32,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2018-04-05 17:30:32,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:30:32,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:32,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 67 [2018-04-05 17:30:32,624 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 49 treesize of output 48 [2018-04-05 17:30:32,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:32,666 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 48 treesize of output 58 [2018-04-05 17:30:32,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:32,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-04-05 17:30:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2018-04-05 17:30:32,741 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:32,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-05 17:30:32,803 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:32,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-05 17:30:32,858 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2018-04-05 17:30:32,916 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:32,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-04-05 17:30:32,971 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:33,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-04-05 17:30:33,016 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:33,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:30:33,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-04-05 17:30:33,109 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 42 treesize of output 49 [2018-04-05 17:30:33,109 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:33,204 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 4 case distinctions, treesize of input 35 treesize of output 73 [2018-04-05 17:30:33,205 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 7 xjuncts. [2018-04-05 17:30:33,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-05 17:30:33,315 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:33,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-05 17:30:33,317 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:33,319 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 28 [2018-04-05 17:30:33,320 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:33,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-04-05 17:30:33,396 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-05 17:30: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 1 case distinctions, treesize of input 24 treesize of output 20 [2018-04-05 17:30:33,467 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:33,602 INFO L267 ElimStorePlain]: Start of recursive call 14: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:30:33,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 79 [2018-04-05 17:30:33,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-04-05 17:30:33,714 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:34,440 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 4 case distinctions, treesize of input 37 treesize of output 75 [2018-04-05 17:30:34,441 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 7 xjuncts. [2018-04-05 17:30:35,203 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 34 treesize of output 30 [2018-04-05 17:30:35,203 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:35,205 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 28 [2018-04-05 17:30:35,206 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:35,208 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 29 treesize of output 25 [2018-04-05 17:30:35,209 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:35,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:30:35,854 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:36,441 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 48 treesize of output 51 [2018-04-05 17:30:36,442 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:37,010 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 45 treesize of output 48 [2018-04-05 17:30:37,010 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:37,627 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 4 case distinctions, treesize of input 31 treesize of output 69 [2018-04-05 17:30:37,628 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 7 xjuncts. [2018-04-05 17:30:38,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-05 17:30:38,111 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:38,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-04-05 17:30:38,852 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:39,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-05 17:30:39,160 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:39,162 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 28 [2018-04-05 17:30:39,163 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:39,164 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 31 treesize of output 27 [2018-04-05 17:30:39,165 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:30:39,827 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:40,048 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 44 treesize of output 36 [2018-04-05 17:30:40,049 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:40,270 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 44 treesize of output 36 [2018-04-05 17:30:40,271 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:40,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-05 17:30:40,707 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:40,709 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 26 treesize of output 22 [2018-04-05 17:30:40,709 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:40,901 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 30 treesize of output 41 [2018-04-05 17:30:40,901 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:41,476 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 54 treesize of output 42 [2018-04-05 17:30:41,477 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:41,665 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 55 [2018-04-05 17:30:41,665 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:41,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-05 17:30:41,863 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:42,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-05 17:30:42,050 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:42,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-05 17:30:42,418 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:42,571 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 37 treesize of output 33 [2018-04-05 17:30:42,571 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:42,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-04-05 17:30:42,721 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:42,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-04-05 17:30:42,727 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:42,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-05 17:30:42,836 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:42,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-05 17:30:42,838 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:42,942 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 37 treesize of output 37 [2018-04-05 17:30:42,942 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:44,029 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 22 treesize of output 22 [2018-04-05 17:30:44,030 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:44,663 INFO L267 ElimStorePlain]: Start of recursive call 22: 57 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:30:44,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:30:44,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 78 [2018-04-05 17:30:44,783 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 52 treesize of output 51 [2018-04-05 17:30:44,783 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:44,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:44,907 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 45 treesize of output 53 [2018-04-05 17:30:44,907 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:45,027 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 51 treesize of output 61 [2018-04-05 17:30:45,028 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:45,165 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:45,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 63 [2018-04-05 17:30:45,176 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:45,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2018-04-05 17:30:45,589 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 127 DAG size of output 121 [2018-04-05 17:30:45,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 59 [2018-04-05 17:30:45,613 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2018-04-05 17:30:45,768 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:45,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2018-04-05 17:30:45,849 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:45,913 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 36 treesize of output 36 [2018-04-05 17:30:45,914 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:45,979 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 38 treesize of output 49 [2018-04-05 17:30:45,980 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:46,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-05 17:30:46,046 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-05 17:30:46,110 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-05 17:30:46,111 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,260 INFO L267 ElimStorePlain]: Start of recursive call 60: 10 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-05 17:30:46,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 63 [2018-04-05 17:30:46,487 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 48 treesize of output 44 [2018-04-05 17:30:46,488 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:46,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:30:46,599 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,601 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 36 treesize of output 28 [2018-04-05 17:30:46,601 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-05 17:30:46,706 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:46,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:46,807 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:46,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 76 [2018-04-05 17:30:46,823 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 7 xjuncts. [2018-04-05 17:30:46,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-04-05 17:30:46,969 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:47,109 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 25 treesize of output 21 [2018-04-05 17:30:47,109 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:47,111 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 22 treesize of output 18 [2018-04-05 17:30:47,111 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:47,215 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 28 treesize of output 39 [2018-04-05 17:30:47,215 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-05 17:30:47,310 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:47,357 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:47,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:30:47,368 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 31 treesize of output 45 [2018-04-05 17:30:47,369 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:47,525 INFO L267 ElimStorePlain]: Start of recursive call 69: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:30:47,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 62 [2018-04-05 17:30:47,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 41 treesize of output 33 [2018-04-05 17:30:47,544 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:47,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2018-04-05 17:30:47,608 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 3 xjuncts. [2018-04-05 17:30:47,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-04-05 17:30:47,718 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:47,852 INFO L267 ElimStorePlain]: Start of recursive call 81: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:30:48,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 84 [2018-04-05 17:30:48,321 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:30:51,823 WARN L151 SmtUtils]: Spent 3483ms on a formula simplification. DAG size of input: 807 DAG size of output 799 [2018-04-05 17:30:51,825 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:30:51,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-05 17:30:51,829 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-05 17:30:53,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-04-05 17:30:53,912 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-05 17:30:55,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 74 [2018-04-05 17:30:55,949 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 16 xjuncts. [2018-04-05 17:30:58,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 77 [2018-04-05 17:30:58,229 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 16 xjuncts. [2018-04-05 17:30:59,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 74 [2018-04-05 17:30:59,949 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 16 xjuncts. [2018-04-05 17:31:01,115 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 27 treesize of output 38 [2018-04-05 17:31:01,116 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:04,296 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 41 treesize of output 44 [2018-04-05 17:31:04,297 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:05,702 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 32 treesize of output 32 [2018-04-05 17:31:05,703 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:05,715 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2018-04-05 17:31:05,716 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:06,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-05 17:31:06,168 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:06,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 42 treesize of output 34 [2018-04-05 17:31:06,814 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:07,125 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 34 treesize of output 22 [2018-04-05 17:31:07,125 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:07,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-04-05 17:31:07,503 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:10,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-05 17:31:10,404 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:11,338 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 24 treesize of output 35 [2018-04-05 17:31:11,339 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:11,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 44 [2018-04-05 17:31:11,598 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:11,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-05 17:31:11,860 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:12,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-05 17:31:12,616 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:13,692 INFO L267 ElimStorePlain]: Start of recursive call 85: 82 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-05 17:31:13,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 82 [2018-04-05 17:31:13,827 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 54 treesize of output 41 [2018-04-05 17:31:13,827 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:14,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 75 [2018-04-05 17:31:14,526 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 7 xjuncts. [2018-04-05 17:31:15,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 32 treesize of output 24 [2018-04-05 17:31:15,350 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:16,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-05 17:31:16,194 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:16,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-05 17:31:16,833 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:17,532 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 44 treesize of output 55 [2018-04-05 17:31:17,533 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:18,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-05 17:31:18,170 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:18,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:31:18,172 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:18,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 28 [2018-04-05 17:31:18,715 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:19,209 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 54 treesize of output 42 [2018-04-05 17:31:19,210 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:19,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-05 17:31:19,673 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:21,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2018-04-05 17:31:21,486 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-05 17:31:21,938 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:22,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-05 17:31:22,383 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:22,823 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 40 treesize of output 40 [2018-04-05 17:31:22,823 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:23,281 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 54 treesize of output 46 [2018-04-05 17:31:23,281 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:24,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2018-04-05 17:31:24,208 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:24,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 28 [2018-04-05 17:31:24,692 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:24,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-05 17:31:24,694 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:25,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-04-05 17:31:25,623 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:25,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 25 treesize of output 17 [2018-04-05 17:31:25,625 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:25,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 72 [2018-04-05 17:31:25,944 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 7 xjuncts. [2018-04-05 17:31:26,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 13 [2018-04-05 17:31:26,991 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:27,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-04-05 17:31:27,150 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:27,322 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 34 treesize of output 45 [2018-04-05 17:31:27,323 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:27,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-05 17:31:27,748 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:29,206 INFO L267 ElimStorePlain]: Start of recursive call 104: 57 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:31:29,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 84 [2018-04-05 17:31:29,365 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:31:32,952 WARN L151 SmtUtils]: Spent 3568ms on a formula simplification. DAG size of input: 820 DAG size of output 820 [2018-04-05 17:31:32,952 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:31:32,952 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:31:32,953 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:31:32,953 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:31:32,954 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:31:32,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-05 17:31:32,957 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:35,290 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 5 case distinctions, treesize of input 38 treesize of output 77 [2018-04-05 17:31:35,292 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 16 xjuncts. [2018-04-05 17:31:37,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2018-04-05 17:31:37,274 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:38,866 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 4 case distinctions, treesize of input 34 treesize of output 72 [2018-04-05 17:31:38,867 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 7 xjuncts. [2018-04-05 17:31:40,242 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 27 treesize of output 38 [2018-04-05 17:31:40,242 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:42,688 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2018-04-05 17:31:42,689 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:43,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 74 [2018-04-05 17:31:43,664 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 16 xjuncts. [2018-04-05 17:31:44,491 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 22 treesize of output 17 [2018-04-05 17:31:44,491 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:45,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:31:45,154 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:45,776 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 27 treesize of output 38 [2018-04-05 17:31:45,776 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:48,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-04-05 17:31:48,181 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:48,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 31 [2018-04-05 17:31:48,183 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:48,997 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 31 treesize of output 31 [2018-04-05 17:31:48,998 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:49,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-05 17:31:49,000 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:49,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-04-05 17:31:49,962 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:50,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-05 17:31:50,174 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:52,553 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 24 treesize of output 35 [2018-04-05 17:31:52,554 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 3 xjuncts. [2018-04-05 17:31:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-05 17:31:52,825 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:53,010 INFO L267 ElimStorePlain]: Start of recursive call 131: 82 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:31:53,072 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:31:53,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:31:53,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-05 17:31:53,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:31:53,220 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:53,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-05 17:31:53,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 15 [2018-04-05 17:31:53,247 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:53,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 17:31:53,257 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:53,269 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 16 treesize of output 16 [2018-04-05 17:31:53,270 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-04-05 17:31:53,274 INFO L267 ElimStorePlain]: Start of recursive call 152: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:31:53,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-05 17:31:53,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 17:31:53,281 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:53,284 INFO L267 ElimStorePlain]: Start of recursive call 156: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:53,298 INFO L267 ElimStorePlain]: Start of recursive call 150: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:31:53,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 35 xjuncts. [2018-04-05 17:31:53,385 INFO L202 ElimStorePlain]: Needed 157 recursive calls to eliminate 7 variables, input treesize:130, output treesize:956 [2018-04-05 17:31:53,766 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 82 DAG size of output 29 [2018-04-05 17:31:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:31:54,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:31:54,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2018-04-05 17:31:54,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-05 17:31:54,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-05 17:31:54,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1429, Unknown=9, NotChecked=0, Total=1560 [2018-04-05 17:31:54,650 INFO L87 Difference]: Start difference. First operand 497 states and 532 transitions. Second operand 40 states. [2018-04-05 17:31:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:31:57,723 INFO L93 Difference]: Finished difference Result 594 states and 632 transitions. [2018-04-05 17:31:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-05 17:31:57,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 93 [2018-04-05 17:31:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:31:57,725 INFO L225 Difference]: With dead ends: 594 [2018-04-05 17:31:57,725 INFO L226 Difference]: Without dead ends: 593 [2018-04-05 17:31:57,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=505, Invalid=3392, Unknown=9, NotChecked=0, Total=3906 [2018-04-05 17:31:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-05 17:31:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 501. [2018-04-05 17:31:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-04-05 17:31:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 537 transitions. [2018-04-05 17:31:57,748 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 537 transitions. Word has length 93 [2018-04-05 17:31:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:31:57,748 INFO L459 AbstractCegarLoop]: Abstraction has 501 states and 537 transitions. [2018-04-05 17:31:57,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-05 17:31:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 537 transitions. [2018-04-05 17:31:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-05 17:31:57,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:31:57,749 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, 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-05 17:31:57,749 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-05 17:31:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1384752090, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:31:57,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:31:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:31:57,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:31:57,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:31:57,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:31:57,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:31:57,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:31:57,879 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-05 17:31:57,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-05 17:31:57,926 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-05 17:31:57,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:31:57,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,948 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-05 17:31:57,950 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-05 17:31:57,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:57,960 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-05 17:31:57,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2018-04-05 17:31:58,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:31:58,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,073 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-05 17:31:58,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:58 [2018-04-05 17:31:58,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-05 17:31:58,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-05 17:31:58,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,153 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 51 treesize of output 45 [2018-04-05 17:31:58,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 17:31:58,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:31:58,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:96, output treesize:73 [2018-04-05 17:31:58,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:31:58,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:31:58,421 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 73 treesize of output 77 [2018-04-05 17:31:58,424 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:31:58,425 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-05 17:31:58,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:31:58,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, 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 30 [2018-04-05 17:31:58,442 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-05 17:31:58,451 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-05 17:31:58,475 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 46 treesize of output 40 [2018-04-05 17:31:58,477 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:31:58,478 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 22 treesize of output 17 [2018-04-05 17:31:58,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:31:58,487 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-05 17:31:58,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:31:58,505 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:118, output treesize:9 [2018-04-05 17:31:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:31:58,595 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:00,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 101 [2018-04-05 17:32:00,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:00,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 101 [2018-04-05 17:32:00,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:00,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-05 17:32:00,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:168, output treesize:193 [2018-04-05 17:32:13,172 WARN L148 SmtUtils]: Spent 4313ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-05 17:32:32,618 WARN L148 SmtUtils]: Spent 16423ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-05 17:32:39,276 WARN L148 SmtUtils]: Spent 6058ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-05 17:32:44,378 WARN L148 SmtUtils]: Spent 4601ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-05 17:32:44,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 101 [2018-04-05 17:32:44,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 17:32:44,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:44,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 67 [2018-04-05 17:32:44,507 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 49 treesize of output 48 [2018-04-05 17:32:44,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:44,557 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 48 treesize of output 58 [2018-04-05 17:32:44,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:44,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 74 [2018-04-05 17:32:44,641 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 54 treesize of output 50 [2018-04-05 17:32:44,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:44,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:32:44,942 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:45,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2018-04-05 17:32:45,227 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-04-05 17:32:45,534 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 44 treesize of output 44 [2018-04-05 17:32:45,534 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:45,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-04-05 17:32:45,880 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:46,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-04-05 17:32:46,191 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-05 17:32:46,193 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,450 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 44 treesize of output 36 [2018-04-05 17:32:46,450 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:46,729 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 55 [2018-04-05 17:32:46,730 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-05 17:32:47,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-05 17:32:47,004 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 25 treesize of output 17 [2018-04-05 17:32:47,006 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,244 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 4 case distinctions, treesize of input 34 treesize of output 72 [2018-04-05 17:32:47,246 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 7 xjuncts. [2018-04-05 17:32:47,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-04-05 17:32:47,451 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 31 [2018-04-05 17:32:47,772 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-05 17:32:47,931 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:48,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-05 17:32:48,093 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:48,263 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2018-04-05 17:32:48,264 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-04-05 17:32:48,593 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 39 [2018-04-05 17:32:48,594 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:48,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 10 [2018-04-05 17:32:48,754 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:49,233 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 41 treesize of output 48 [2018-04-05 17:32:49,234 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-04-05 17:32:49,402 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 31 treesize of output 27 [2018-04-05 17:32:49,403 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:49,405 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 28 [2018-04-05 17:32:49,405 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:49,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-05 17:32:49,408 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-05 17:32:50,179 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-05 17:32:50,306 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-05 17:32:50,432 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:50,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-05 17:32:50,565 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,598 INFO L267 ElimStorePlain]: Start of recursive call 7: 34 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:32:50,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 80 [2018-04-05 17:32:52,047 WARN L151 SmtUtils]: Spent 1333ms on a formula simplification. DAG size of input: 432 DAG size of output 430 [2018-04-05 17:32:52,048 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:32:52,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-05 17:32:52,050 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:52,882 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 46 treesize of output 33 [2018-04-05 17:32:52,882 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:52,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 35 treesize of output 27 [2018-04-05 17:32:52,884 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:53,694 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 44 treesize of output 40 [2018-04-05 17:32:53,695 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-04-05 17:32:54,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 75 [2018-04-05 17:32:54,467 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 7 xjuncts. [2018-04-05 17:32:55,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-04-05 17:32:55,443 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-05 17:32:55,998 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 17:32:55,998 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 17:32:56,004 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 17:32:56,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:32:56 BoogieIcfgContainer [2018-04-05 17:32:56,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 17:32:56,005 INFO L168 Benchmark]: Toolchain (without parser) took 252503.06 ms. Allocated memory was 302.5 MB in the beginning and 407.9 MB in the end (delta: 105.4 MB). Free memory was 240.3 MB in the beginning and 345.4 MB in the end (delta: -105.1 MB). Peak memory consumption was 77.1 MB. Max. memory is 5.3 GB. [2018-04-05 17:32:56,006 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.5 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 17:32:56,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.71 ms. Allocated memory is still 302.5 MB. Free memory was 240.3 MB in the beginning and 215.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:32:56,007 INFO L168 Benchmark]: Boogie Preprocessor took 73.00 ms. Allocated memory is still 302.5 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:32:56,007 INFO L168 Benchmark]: RCFGBuilder took 1002.64 ms. Allocated memory was 302.5 MB in the beginning and 466.1 MB in the end (delta: 163.6 MB). Free memory was 212.3 MB in the beginning and 388.7 MB in the end (delta: -176.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-04-05 17:32:56,008 INFO L168 Benchmark]: TraceAbstraction took 250995.15 ms. Allocated memory was 466.1 MB in the beginning and 407.9 MB in the end (delta: -58.2 MB). Free memory was 388.7 MB in the beginning and 345.4 MB in the end (delta: 43.3 MB). Peak memory consumption was 61.9 MB. Max. memory is 5.3 GB. [2018-04-05 17:32:56,022 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.23 ms. Allocated memory is still 302.5 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 426.71 ms. Allocated memory is still 302.5 MB. Free memory was 240.3 MB in the beginning and 215.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 73.00 ms. Allocated memory is still 302.5 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1002.64 ms. Allocated memory was 302.5 MB in the beginning and 466.1 MB in the end (delta: 163.6 MB). Free memory was 212.3 MB in the beginning and 388.7 MB in the end (delta: -176.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 250995.15 ms. Allocated memory was 466.1 MB in the beginning and 407.9 MB in the end (delta: -58.2 MB). Free memory was 388.7 MB in the beginning and 345.4 MB in the end (delta: 43.3 MB). Peak memory consumption was 61.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 94 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 394. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 33 error locations. TIMEOUT Result, 250.9s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 28.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4691 SDtfs, 20492 SDslu, 40967 SDs, 0 SdLazy, 17038 SolverSat, 1596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4471 GetRequests, 3550 SyntacticMatches, 22 SemanticMatches, 899 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6713 ImplicationChecksByTransitivity, 82.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 3138 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 161.2s InterpolantComputationTime, 2052 NumberOfCodeBlocks, 2052 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4038 ConstructedInterpolants, 1242 QuantifiedInterpolants, 6169917 SizeOfPredicates, 468 NumberOfNonLiveVariables, 5268 ConjunctsInSsa, 659 ConjunctsInUnsatCore, 66 InterpolantComputations, 26 PerfectInterpolantSequences, 194/774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_17-32-56-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_17-32-56-033.csv Completed graceful shutdown