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/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:50:59,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:50:59,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:50:59,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:50:59,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:50:59,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:50:59,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:50:59,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:50:59,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:50:59,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:50:59,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:50:59,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:50:59,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:50:59,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:50:59,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:50:59,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:50:59,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:50:59,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:50:59,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:50:59,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:50:59,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:50:59,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:50:59,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:50:59,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:50:59,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:50:59,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:50:59,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:50:59,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:50:59,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:50:59,640 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:50:59,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:50:59,641 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-09 21:50:59,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:50:59,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:50:59,665 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:50:59,666 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:50:59,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:50:59,666 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:50:59,667 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:50:59,667 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:50:59,667 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:50:59,667 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:50:59,668 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:50:59,668 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:50:59,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:50:59,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:50:59,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:50:59,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:50:59,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:50:59,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:50:59,670 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:50:59,670 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:50:59,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:50:59,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:50:59,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:50:59,671 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:50:59,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:50:59,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:50:59,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:50:59,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:50:59,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:50:59,673 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:50:59,673 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:50:59,673 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:50:59,673 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:50:59,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:50:59,717 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:50:59,720 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:50:59,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:50:59,722 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:50:59,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,029 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfb7f7efc1 [2018-04-09 21:51:00,206 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:51:00,207 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:51:00,207 INFO L168 CDTParser]: Scanning test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,218 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:51:00,218 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:51:00,219 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:51:00,219 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,219 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:51:00,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:00,250 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfb7f7efc1 [2018-04-09 21:51:00,254 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:51:00,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:51:00,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:51:00,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:51:00,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:51:00,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39749c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00, skipping insertion in model container [2018-04-09 21:51:00,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,279 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:51:00,311 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:51:00,494 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:51:00,545 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:51:00,552 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-09 21:51:00,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00 WrapperNode [2018-04-09 21:51:00,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:51:00,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:51:00,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:51:00,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:51:00,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (1/1) ... [2018-04-09 21:51:00,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:51:00,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:51:00,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:51:00,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:51:00,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (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-09 21:51:00,783 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:51:00,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:51:00,784 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:51:00,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:51:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:51:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:51:00,787 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:51:00,788 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:51:00,789 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:51:00,790 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:51:00,791 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:51:00,792 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:51:00,793 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:51:00,794 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:51:00,795 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:51:00,796 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:51:00,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 21:51:01,302 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:51:01,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:51:01 BoogieIcfgContainer [2018-04-09 21:51:01,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:51:01,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:51:01,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:51:01,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:51:01,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:51:00" (1/3) ... [2018-04-09 21:51:01,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f662ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:51:01, skipping insertion in model container [2018-04-09 21:51:01,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:51:00" (2/3) ... [2018-04-09 21:51:01,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f662ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:51:01, skipping insertion in model container [2018-04-09 21:51:01,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:51:01" (3/3) ... [2018-04-09 21:51:01,312 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-04-09 21:51:01,326 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:51:01,336 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-09 21:51:01,389 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:51:01,389 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:51:01,389 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:51:01,390 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:51:01,390 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:51:01,390 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:51:01,390 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:51:01,390 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:51:01,390 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:51:01,390 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:51:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-09 21:51:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-09 21:51:01,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:01,413 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:01,413 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1933591286, 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-09 21:51:01,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:01,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:01,480 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-09 21:51:01,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:01,493 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-09 21:51:01,516 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:01,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:51:01,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 21:51:01,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 21:51:01,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:51:01,529 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2018-04-09 21:51:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:01,560 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-04-09 21:51:01,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 21:51:01,561 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-04-09 21:51:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:01,572 INFO L225 Difference]: With dead ends: 272 [2018-04-09 21:51:01,572 INFO L226 Difference]: Without dead ends: 136 [2018-04-09 21:51:01,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-09 21:51:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-09 21:51:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-04-09 21:51:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-09 21:51:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2018-04-09 21:51:01,617 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 14 [2018-04-09 21:51:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:01,618 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-04-09 21:51:01,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 21:51:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2018-04-09 21:51:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 21:51:01,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:01,619 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:01,619 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 264732255, 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-09 21:51:01,626 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:01,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:01,653 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-09 21:51:01,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:01,666 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-09 21:51:01,687 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:01,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:51:01,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:51:01,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:51:01,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:51:01,690 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 3 states. [2018-04-09 21:51:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:01,832 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-04-09 21:51:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:51:01,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-09 21:51:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:01,840 INFO L225 Difference]: With dead ends: 193 [2018-04-09 21:51:01,840 INFO L226 Difference]: Without dead ends: 190 [2018-04-09 21:51:01,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-09 21:51:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-09 21:51:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-04-09 21:51:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-09 21:51:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-04-09 21:51:01,861 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 20 [2018-04-09 21:51:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:01,862 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-04-09 21:51:01,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:51:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-04-09 21:51:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-09 21:51:01,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:01,863 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:01,863 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1081691960, 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-09 21:51:01,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:01,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:01,923 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-09 21:51:01,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:01,938 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-09 21:51:01,961 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:01,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:01,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:51:01,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:51:01,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:51:01,962 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 3 states. [2018-04-09 21:51:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:02,005 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-04-09 21:51:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:51:02,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-09 21:51:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:02,007 INFO L225 Difference]: With dead ends: 193 [2018-04-09 21:51:02,007 INFO L226 Difference]: Without dead ends: 146 [2018-04-09 21:51:02,008 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-09 21:51:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-09 21:51:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2018-04-09 21:51:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-09 21:51:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-04-09 21:51:02,018 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 23 [2018-04-09 21:51:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:02,019 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-04-09 21:51:02,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:51:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-04-09 21:51:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-09 21:51:02,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:02,020 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-09 21:51:02,020 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1171687206, 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-09 21:51:02,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:02,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:02,058 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-09 21:51:02,058 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:02,077 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-09 21:51:02,099 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:02,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:02,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:51:02,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:51:02,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:51:02,100 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 3 states. [2018-04-09 21:51:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:02,121 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-04-09 21:51:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:51:02,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-09 21:51:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:02,123 INFO L225 Difference]: With dead ends: 270 [2018-04-09 21:51:02,123 INFO L226 Difference]: Without dead ends: 143 [2018-04-09 21:51:02,124 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-09 21:51:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-09 21:51:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-09 21:51:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-09 21:51:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-04-09 21:51:02,136 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 23 [2018-04-09 21:51:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:02,136 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-04-09 21:51:02,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:51:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-04-09 21:51:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 21:51:02,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:02,137 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-09 21:51:02,137 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1738257955, 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-09 21:51:02,159 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:02,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:02,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:02,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:02,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:02,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:51:02,233 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-09 21:51:02,233 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:02,239 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-09 21:51:02,267 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:02,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:02,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:51:02,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:51:02,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:51:02,268 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 4 states. [2018-04-09 21:51:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:02,387 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-04-09 21:51:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:51:02,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-09 21:51:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:02,389 INFO L225 Difference]: With dead ends: 193 [2018-04-09 21:51:02,389 INFO L226 Difference]: Without dead ends: 185 [2018-04-09 21:51:02,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-09 21:51:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 135. [2018-04-09 21:51:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-09 21:51:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-04-09 21:51:02,398 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 25 [2018-04-09 21:51:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:02,399 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-04-09 21:51:02,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:51:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-04-09 21:51:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 21:51:02,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:02,400 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-09 21:51:02,400 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1738257956, 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-09 21:51:02,415 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:02,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:02,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:51:02,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:02,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:02,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:51:02,469 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-09 21:51:02,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:02,491 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-09 21:51:02,513 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:02,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:51:02,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:51:02,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:51:02,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:51:02,515 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 6 states. [2018-04-09 21:51:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:02,742 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2018-04-09 21:51:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:51:02,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-09 21:51:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:02,743 INFO L225 Difference]: With dead ends: 218 [2018-04-09 21:51:02,744 INFO L226 Difference]: Without dead ends: 212 [2018-04-09 21:51:02,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:51:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-09 21:51:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 142. [2018-04-09 21:51:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-09 21:51:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-04-09 21:51:02,752 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 25 [2018-04-09 21:51:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:02,753 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-04-09 21:51:02,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:51:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-04-09 21:51:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 21:51:02,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:02,754 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:02,754 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash 147547010, 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-09 21:51:02,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:02,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:02,803 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:02,826 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-09 21:51:02,847 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:02,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:02,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:51:02,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:51:02,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:51:02,848 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 3 states. [2018-04-09 21:51:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:02,875 INFO L93 Difference]: Finished difference Result 332 states and 362 transitions. [2018-04-09 21:51:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:51:02,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-04-09 21:51:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:02,877 INFO L225 Difference]: With dead ends: 332 [2018-04-09 21:51:02,877 INFO L226 Difference]: Without dead ends: 206 [2018-04-09 21:51:02,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-09 21:51:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-09 21:51:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2018-04-09 21:51:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-09 21:51:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-04-09 21:51:02,889 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 39 [2018-04-09 21:51:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:02,889 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-04-09 21:51:02,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:51:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-04-09 21:51:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 21:51:02,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:02,891 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:02,891 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1995953125, 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-09 21:51:02,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:02,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:02,933 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-09 21:51:02,933 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:02,977 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:02,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:02,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:51:02,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:51:02,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:51:02,978 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 3 states. [2018-04-09 21:51:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:03,002 INFO L93 Difference]: Finished difference Result 341 states and 396 transitions. [2018-04-09 21:51:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:51:03,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-04-09 21:51:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:03,005 INFO L225 Difference]: With dead ends: 341 [2018-04-09 21:51:03,005 INFO L226 Difference]: Without dead ends: 187 [2018-04-09 21:51:03,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-09 21:51:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-09 21:51:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-04-09 21:51:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-09 21:51:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2018-04-09 21:51:03,014 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 43 [2018-04-09 21:51:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:03,015 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2018-04-09 21:51:03,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:51:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2018-04-09 21:51:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 21:51:03,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:03,017 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] [2018-04-09 21:51:03,017 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1527253896, 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-09 21:51:03,029 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:03,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:03,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:03,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:51:03,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:03,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:03,136 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-09 21:51:03,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:51:03,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 21:51:03,160 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-09 21:51:03,161 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:03,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:51:03,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-09 21:51:03,280 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-09 21:51:03,302 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:03,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 21:51:03,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:51:03,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:51:03,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:03,303 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand 8 states. [2018-04-09 21:51:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:03,613 INFO L93 Difference]: Finished difference Result 359 states and 393 transitions. [2018-04-09 21:51:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:51:03,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-04-09 21:51:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:03,616 INFO L225 Difference]: With dead ends: 359 [2018-04-09 21:51:03,616 INFO L226 Difference]: Without dead ends: 357 [2018-04-09 21:51:03,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-09 21:51:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 185. [2018-04-09 21:51:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-09 21:51:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2018-04-09 21:51:03,628 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 45 [2018-04-09 21:51:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:03,629 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2018-04-09 21:51:03,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:51:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2018-04-09 21:51:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-09 21:51:03,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:03,631 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] [2018-04-09 21:51:03,631 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash -100230485, 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-09 21:51:03,640 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:03,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:03,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:51:03,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:51:03,692 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-09 21:51:03,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:03,723 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:03,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:03,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:51:03,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:51:03,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:51:03,724 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand 4 states. [2018-04-09 21:51:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:03,837 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-04-09 21:51:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:51:03,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-04-09 21:51:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:03,839 INFO L225 Difference]: With dead ends: 292 [2018-04-09 21:51:03,839 INFO L226 Difference]: Without dead ends: 288 [2018-04-09 21:51:03,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:03,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-09 21:51:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 181. [2018-04-09 21:51:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-09 21:51:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2018-04-09 21:51:03,850 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 46 [2018-04-09 21:51:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:03,851 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2018-04-09 21:51:03,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:51:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2018-04-09 21:51:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-09 21:51:03,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:03,852 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] [2018-04-09 21:51:03,852 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash -100230484, 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-09 21:51:03,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:03,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:03,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:51:03,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:03,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:51:03,890 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-09 21:51:03,890 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:03,929 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:03,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:51:03,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:51:03,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:51:03,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:51:03,929 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 6 states. [2018-04-09 21:51:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:04,088 INFO L93 Difference]: Finished difference Result 357 states and 388 transitions. [2018-04-09 21:51:04,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:04,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-09 21:51:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:04,090 INFO L225 Difference]: With dead ends: 357 [2018-04-09 21:51:04,090 INFO L226 Difference]: Without dead ends: 353 [2018-04-09 21:51:04,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:51:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-09 21:51:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 177. [2018-04-09 21:51:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-09 21:51:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-04-09 21:51:04,097 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 46 [2018-04-09 21:51:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:04,098 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-04-09 21:51:04,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:51:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-04-09 21:51:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-09 21:51:04,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:04,099 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:04,099 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash -964039363, 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-09 21:51:04,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:04,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:04,134 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-09 21:51:04,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:04,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-09 21:51:04,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:04,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:04,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-09 21:51:04,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:51:04,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 32 [2018-04-09 21:51:04,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,235 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-09 21:51:04,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-09 21:51:04,254 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 35 treesize of output 33 [2018-04-09 21:51:04,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 22 [2018-04-09 21:51:04,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,287 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 22 treesize of output 14 [2018-04-09 21:51:04,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-09 21:51:04,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,315 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-09 21:51:04,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-09 21:51:04,327 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-09 21:51:04,327 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:04,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 21:51:04,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-09 21:51:04,399 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-09 21:51:04,421 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:04,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2018-04-09 21:51:04,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:51:04,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:51:04,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:04,422 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 9 states. [2018-04-09 21:51:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:04,704 INFO L93 Difference]: Finished difference Result 290 states and 312 transitions. [2018-04-09 21:51:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 21:51:04,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-04-09 21:51:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:04,705 INFO L225 Difference]: With dead ends: 290 [2018-04-09 21:51:04,705 INFO L226 Difference]: Without dead ends: 289 [2018-04-09 21:51:04,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:51:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-09 21:51:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 209. [2018-04-09 21:51:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-09 21:51:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 229 transitions. [2018-04-09 21:51:04,713 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 229 transitions. Word has length 49 [2018-04-09 21:51:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:04,713 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 229 transitions. [2018-04-09 21:51:04,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:51:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 229 transitions. [2018-04-09 21:51:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-09 21:51:04,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:04,714 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:04,714 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash -964039362, 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-09 21:51:04,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:04,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:04,752 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-09 21:51:04,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:51:04,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,764 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-09 21:51:04,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:04,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-09 21:51:04,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:04,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:04,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:04,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-09 21:51:04,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:51:04,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:04,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-09 21:51:04,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:54 [2018-04-09 21:51:04,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 21:51:04,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:51:04,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:04,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 21:51:04,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:51:04,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:51:05,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:76 [2018-04-09 21:51:05,061 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 35 treesize of output 29 [2018-04-09 21:51:05,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:05,066 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 20 treesize of output 12 [2018-04-09 21:51:05,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:51:05,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,104 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 35 treesize of output 29 [2018-04-09 21:51:05,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:05,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 21:51:05,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:51:05,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,124 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-09 21:51:05,124 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:90, output treesize:22 [2018-04-09 21:51:05,145 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-09 21:51:05,145 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:05,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 treesize of output 31 [2018-04-09 21:51:05,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-04-09 21:51:05,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-09 21:51:05,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 21:51:05,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-09 21:51:05,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:134 [2018-04-09 21:51:05,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-04-09 21:51:05,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17 [2018-04-09 21:51:05,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, 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-09 21:51:05,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,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 18 treesize of output 16 [2018-04-09 21:51:05,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 21:51:05,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 6 [2018-04-09 21:51:05,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:05,448 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:155, output treesize:6 [2018-04-09 21:51:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:05,494 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:05,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-09 21:51:05,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:51:05,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:51:05,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:51:05,495 INFO L87 Difference]: Start difference. First operand 209 states and 229 transitions. Second operand 17 states. [2018-04-09 21:51:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:06,309 INFO L93 Difference]: Finished difference Result 367 states and 392 transitions. [2018-04-09 21:51:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:51:06,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-09 21:51:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:06,311 INFO L225 Difference]: With dead ends: 367 [2018-04-09 21:51:06,311 INFO L226 Difference]: Without dead ends: 366 [2018-04-09 21:51:06,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:51:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-09 21:51:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 209. [2018-04-09 21:51:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-09 21:51:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 227 transitions. [2018-04-09 21:51:06,318 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 227 transitions. Word has length 49 [2018-04-09 21:51:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:06,318 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 227 transitions. [2018-04-09 21:51:06,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:51:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 227 transitions. [2018-04-09 21:51:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:51:06,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:06,319 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:06,319 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1481253367, 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-09 21:51:06,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:06,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:06,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:06,497 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:06,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-09 21:51:06,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:51:06,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:51:06,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:06,498 INFO L87 Difference]: Start difference. First operand 209 states and 227 transitions. Second operand 5 states. [2018-04-09 21:51:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:06,524 INFO L93 Difference]: Finished difference Result 347 states and 377 transitions. [2018-04-09 21:51:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:06,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-04-09 21:51:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:06,525 INFO L225 Difference]: With dead ends: 347 [2018-04-09 21:51:06,525 INFO L226 Difference]: Without dead ends: 211 [2018-04-09 21:51:06,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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-09 21:51:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-09 21:51:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2018-04-09 21:51:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-09 21:51:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-04-09 21:51:06,534 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 50 [2018-04-09 21:51:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:06,534 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-04-09 21:51:06,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:51:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-04-09 21:51:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 21:51:06,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:06,535 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:06,535 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1195220212, 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-09 21:51:06,544 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:06,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:51:06,608 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:51:06,643 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:06,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 21:51:06,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:51:06,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:51:06,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:51:06,643 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 6 states. [2018-04-09 21:51:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:06,693 INFO L93 Difference]: Finished difference Result 217 states and 233 transitions. [2018-04-09 21:51:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:51:06,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-09 21:51:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:06,695 INFO L225 Difference]: With dead ends: 217 [2018-04-09 21:51:06,695 INFO L226 Difference]: Without dead ends: 214 [2018-04-09 21:51:06,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:51:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-09 21:51:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-04-09 21:51:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-09 21:51:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-04-09 21:51:06,704 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 52 [2018-04-09 21:51:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:06,705 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-04-09 21:51:06,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:51:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-04-09 21:51:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:51:06,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:06,706 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:06,706 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1554225681, 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-09 21:51:06,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:06,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:06,760 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-09 21:51:06,761 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:06,789 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-09 21:51:06,825 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:06,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:51:06,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:51:06,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:51:06,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:06,826 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 5 states. [2018-04-09 21:51:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:06,879 INFO L93 Difference]: Finished difference Result 217 states and 233 transitions. [2018-04-09 21:51:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:51:06,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-09 21:51:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:06,881 INFO L225 Difference]: With dead ends: 217 [2018-04-09 21:51:06,881 INFO L226 Difference]: Without dead ends: 214 [2018-04-09 21:51:06,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:51:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-09 21:51:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-04-09 21:51:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-09 21:51:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 226 transitions. [2018-04-09 21:51:06,892 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 226 transitions. Word has length 54 [2018-04-09 21:51:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:06,892 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 226 transitions. [2018-04-09 21:51:06,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:51:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 226 transitions. [2018-04-09 21:51:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 21:51:06,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:06,893 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:06,893 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1523413141, 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-09 21:51:06,902 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:06,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:06,950 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-09 21:51:06,950 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:06,987 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-09 21:51:07,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:07,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-04-09 21:51:07,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:51:07,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:51:07,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:07,023 INFO L87 Difference]: Start difference. First operand 210 states and 226 transitions. Second operand 9 states. [2018-04-09 21:51:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:07,114 INFO L93 Difference]: Finished difference Result 368 states and 395 transitions. [2018-04-09 21:51:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 21:51:07,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-04-09 21:51:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:07,115 INFO L225 Difference]: With dead ends: 368 [2018-04-09 21:51:07,116 INFO L226 Difference]: Without dead ends: 320 [2018-04-09 21:51:07,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 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-09 21:51:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-09 21:51:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 294. [2018-04-09 21:51:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-09 21:51:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 323 transitions. [2018-04-09 21:51:07,127 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 323 transitions. Word has length 55 [2018-04-09 21:51:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:07,127 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 323 transitions. [2018-04-09 21:51:07,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:51:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 323 transitions. [2018-04-09 21:51:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 21:51:07,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:07,128 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:07,128 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2108194216, 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-09 21:51:07,147 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:07,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:07,266 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-09 21:51:07,266 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:07,290 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-09 21:51:07,312 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:07,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:07,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:51:07,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:51:07,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:51:07,313 INFO L87 Difference]: Start difference. First operand 294 states and 323 transitions. Second operand 4 states. [2018-04-09 21:51:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:07,820 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2018-04-09 21:51:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:07,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-04-09 21:51:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:07,822 INFO L225 Difference]: With dead ends: 334 [2018-04-09 21:51:07,822 INFO L226 Difference]: Without dead ends: 333 [2018-04-09 21:51:07,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-09 21:51:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 299. [2018-04-09 21:51:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-09 21:51:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 329 transitions. [2018-04-09 21:51:07,832 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 329 transitions. Word has length 57 [2018-04-09 21:51:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:07,832 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 329 transitions. [2018-04-09 21:51:07,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:51:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 329 transitions. [2018-04-09 21:51:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 21:51:07,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:07,833 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:07,833 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2108194217, 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-09 21:51:07,839 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:07,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:07,930 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-09 21:51:07,930 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:07,967 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-09 21:51:07,990 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:07,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:07,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:51:07,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:51:07,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:51:07,991 INFO L87 Difference]: Start difference. First operand 299 states and 329 transitions. Second operand 4 states. [2018-04-09 21:51:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:08,378 INFO L93 Difference]: Finished difference Result 419 states and 455 transitions. [2018-04-09 21:51:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:08,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-04-09 21:51:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:08,380 INFO L225 Difference]: With dead ends: 419 [2018-04-09 21:51:08,380 INFO L226 Difference]: Without dead ends: 418 [2018-04-09 21:51:08,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-09 21:51:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 334. [2018-04-09 21:51:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-09 21:51:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 367 transitions. [2018-04-09 21:51:08,392 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 367 transitions. Word has length 57 [2018-04-09 21:51:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:08,392 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 367 transitions. [2018-04-09 21:51:08,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:51:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 367 transitions. [2018-04-09 21:51:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:51:08,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:08,393 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:08,393 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash -92756394, 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-09 21:51:08,400 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:08,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:08,459 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-09 21:51:08,459 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:08,467 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-09 21:51:08,499 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:08,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:51:08,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:51:08,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:51:08,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:08,500 INFO L87 Difference]: Start difference. First operand 334 states and 367 transitions. Second operand 5 states. [2018-04-09 21:51:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:08,640 INFO L93 Difference]: Finished difference Result 391 states and 426 transitions. [2018-04-09 21:51:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:51:08,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-04-09 21:51:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:08,641 INFO L225 Difference]: With dead ends: 391 [2018-04-09 21:51:08,641 INFO L226 Difference]: Without dead ends: 389 [2018-04-09 21:51:08,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-09 21:51:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 348. [2018-04-09 21:51:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-09 21:51:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 389 transitions. [2018-04-09 21:51:08,654 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 389 transitions. Word has length 60 [2018-04-09 21:51:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:08,655 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 389 transitions. [2018-04-09 21:51:08,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:51:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 389 transitions. [2018-04-09 21:51:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:51:08,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:08,655 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:08,655 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash -92756393, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:08,669 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:08,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:08,725 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-09 21:51:08,725 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:08,737 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-09 21:51:08,757 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:08,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:51:08,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:51:08,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:51:08,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:08,758 INFO L87 Difference]: Start difference. First operand 348 states and 389 transitions. Second operand 5 states. [2018-04-09 21:51:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:08,858 INFO L93 Difference]: Finished difference Result 378 states and 421 transitions. [2018-04-09 21:51:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:51:08,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-04-09 21:51:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:08,860 INFO L225 Difference]: With dead ends: 378 [2018-04-09 21:51:08,860 INFO L226 Difference]: Without dead ends: 377 [2018-04-09 21:51:08,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-09 21:51:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 370. [2018-04-09 21:51:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-09 21:51:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 414 transitions. [2018-04-09 21:51:08,873 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 414 transitions. Word has length 60 [2018-04-09 21:51:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:08,873 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 414 transitions. [2018-04-09 21:51:08,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:51:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 414 transitions. [2018-04-09 21:51:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 21:51:08,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:08,874 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:08,874 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1356503093, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:08,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:08,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:08,947 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-09 21:51:08,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:08,971 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-09 21:51:08,994 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:08,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 21:51:08,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 21:51:08,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 21:51:08,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:51:08,995 INFO L87 Difference]: Start difference. First operand 370 states and 414 transitions. Second operand 7 states. [2018-04-09 21:51:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:09,106 INFO L93 Difference]: Finished difference Result 418 states and 469 transitions. [2018-04-09 21:51:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:51:09,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2018-04-09 21:51:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:09,108 INFO L225 Difference]: With dead ends: 418 [2018-04-09 21:51:09,108 INFO L226 Difference]: Without dead ends: 417 [2018-04-09 21:51:09,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:51:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-09 21:51:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 396. [2018-04-09 21:51:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-09 21:51:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 454 transitions. [2018-04-09 21:51:09,131 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 454 transitions. Word has length 65 [2018-04-09 21:51:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:09,131 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 454 transitions. [2018-04-09 21:51:09,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 21:51:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 454 transitions. [2018-04-09 21:51:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:51:09,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:09,133 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:09,133 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 898078398, 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-09 21:51:09,146 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:09,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:09,195 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-09 21:51:09,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:09,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-09 21:51:09,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:09,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:09,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:09,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-09 21:51:09,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-09 21:51:09,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:09,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:51:09,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:09,362 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-09 21:51:09,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:5 [2018-04-09 21:51:09,423 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-09 21:51:09,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:09,540 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-09 21:51:09,575 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:09,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 14 [2018-04-09 21:51:09,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:51:09,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:51:09,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:51:09,577 INFO L87 Difference]: Start difference. First operand 396 states and 454 transitions. Second operand 15 states. [2018-04-09 21:51:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:10,138 INFO L93 Difference]: Finished difference Result 520 states and 577 transitions. [2018-04-09 21:51:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:51:10,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2018-04-09 21:51:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:10,140 INFO L225 Difference]: With dead ends: 520 [2018-04-09 21:51:10,140 INFO L226 Difference]: Without dead ends: 519 [2018-04-09 21:51:10,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:51:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-09 21:51:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 405. [2018-04-09 21:51:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-09 21:51:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 465 transitions. [2018-04-09 21:51:10,157 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 465 transitions. Word has length 66 [2018-04-09 21:51:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:10,157 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 465 transitions. [2018-04-09 21:51:10,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:51:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 465 transitions. [2018-04-09 21:51:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:51:10,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:10,158 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:10,158 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 898078399, 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-09 21:51:10,174 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:10,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:10,206 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-09 21:51:10,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:10,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,215 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-09 21:51:10,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:51:10,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-09 21:51:10,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:10,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:10,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:10,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:10,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:10,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:10,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-09 21:51:10,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-09 21:51:10,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:10,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:51:10,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-09 21:51:10,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:10,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:51:10,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:10,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:13 [2018-04-09 21:51:10,386 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-09 21:51:10,386 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:10,530 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-09 21:51:10,565 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:10,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 15 [2018-04-09 21:51:10,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:51:10,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:51:10,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:51:10,566 INFO L87 Difference]: Start difference. First operand 405 states and 465 transitions. Second operand 15 states. [2018-04-09 21:51:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:11,384 INFO L93 Difference]: Finished difference Result 626 states and 734 transitions. [2018-04-09 21:51:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:51:11,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2018-04-09 21:51:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:11,423 INFO L225 Difference]: With dead ends: 626 [2018-04-09 21:51:11,423 INFO L226 Difference]: Without dead ends: 546 [2018-04-09 21:51:11,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-04-09 21:51:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-09 21:51:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 403. [2018-04-09 21:51:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-09 21:51:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 461 transitions. [2018-04-09 21:51:11,446 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 461 transitions. Word has length 66 [2018-04-09 21:51:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:11,447 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 461 transitions. [2018-04-09 21:51:11,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:51:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 461 transitions. [2018-04-09 21:51:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:51:11,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:11,448 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, 1, 1, 1] [2018-04-09 21:51:11,448 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash 693068179, 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-09 21:51:11,461 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:11,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:11,539 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-09 21:51:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:51:11,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:11,601 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_11| Int)) (or (= (store |c_#valid| |v_main_#t~malloc3.base_11| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_11|))))) is different from false [2018-04-09 21:51:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-04-09 21:51:11,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:11,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-09 21:51:11,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:51:11,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:51:11,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2018-04-09 21:51:11,642 INFO L87 Difference]: Start difference. First operand 403 states and 461 transitions. Second operand 13 states. [2018-04-09 21:51:11,652 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc3.base_11| Int)) (or (= (store |c_#valid| |v_main_#t~malloc3.base_11| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_11|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:51:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:11,883 INFO L93 Difference]: Finished difference Result 470 states and 530 transitions. [2018-04-09 21:51:11,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:51:11,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2018-04-09 21:51:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:11,885 INFO L225 Difference]: With dead ends: 470 [2018-04-09 21:51:11,885 INFO L226 Difference]: Without dead ends: 467 [2018-04-09 21:51:11,886 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=228, Unknown=3, NotChecked=102, Total=420 [2018-04-09 21:51:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-09 21:51:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 424. [2018-04-09 21:51:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-09 21:51:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 482 transitions. [2018-04-09 21:51:11,900 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 482 transitions. Word has length 71 [2018-04-09 21:51:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:11,901 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 482 transitions. [2018-04-09 21:51:11,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:51:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 482 transitions. [2018-04-09 21:51:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 21:51:11,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:11,901 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-04-09 21:51:11,902 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash -52782126, 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-09 21:51:11,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:11,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:11,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:51:11,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:11,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:11,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-09 21:51:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:11,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:12,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:12,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-04-09 21:51:12,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:51:12,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:51:12,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:12,003 INFO L87 Difference]: Start difference. First operand 424 states and 482 transitions. Second operand 8 states. [2018-04-09 21:51:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:12,143 INFO L93 Difference]: Finished difference Result 477 states and 529 transitions. [2018-04-09 21:51:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:12,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-04-09 21:51:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:12,145 INFO L225 Difference]: With dead ends: 477 [2018-04-09 21:51:12,145 INFO L226 Difference]: Without dead ends: 476 [2018-04-09 21:51:12,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-09 21:51:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 423. [2018-04-09 21:51:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-09 21:51:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 478 transitions. [2018-04-09 21:51:12,165 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 478 transitions. Word has length 73 [2018-04-09 21:51:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:12,165 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 478 transitions. [2018-04-09 21:51:12,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:51:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 478 transitions. [2018-04-09 21:51:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 21:51:12,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:12,166 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-04-09 21:51:12,166 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -52782125, 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-09 21:51:12,176 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:12,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:12,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:12,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:51:12,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:12,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:12,251 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-09 21:51:12,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-09 21:51:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:12,314 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:12,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:12,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-04-09 21:51:12,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:51:12,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:51:12,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:12,510 INFO L87 Difference]: Start difference. First operand 423 states and 478 transitions. Second operand 9 states. [2018-04-09 21:51:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:12,732 INFO L93 Difference]: Finished difference Result 441 states and 488 transitions. [2018-04-09 21:51:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:51:12,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-04-09 21:51:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:12,734 INFO L225 Difference]: With dead ends: 441 [2018-04-09 21:51:12,734 INFO L226 Difference]: Without dead ends: 440 [2018-04-09 21:51:12,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-09 21:51:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-09 21:51:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 422. [2018-04-09 21:51:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-09 21:51:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 474 transitions. [2018-04-09 21:51:12,758 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 474 transitions. Word has length 73 [2018-04-09 21:51:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:12,758 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 474 transitions. [2018-04-09 21:51:12,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:51:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 474 transitions. [2018-04-09 21:51:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 21:51:12,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:12,759 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 21:51:12,759 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash -115912006, now seen corresponding path program 1 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-09 21:51:12,769 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:12,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:12,851 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-09 21:51:12,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:12,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,861 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-09 21:51:12,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 21:51:12,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-09 21:51:12,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-09 21:51:12,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-09 21:51:12,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-09 21:51:12,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-09 21:51:12,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:12,990 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-09 21:51:12,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 21:51:13,009 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 28 treesize of output 28 [2018-04-09 21:51:13,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 17 [2018-04-09 21:51:13,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 10 [2018-04-09 21:51:13,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,039 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 20 treesize of output 5 [2018-04-09 21:51:13,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:51:13,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-04-09 21:51:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:13,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:13,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:13,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-09 21:51:13,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:51:13,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:51:13,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:51:13,116 INFO L87 Difference]: Start difference. First operand 422 states and 474 transitions. Second operand 13 states. [2018-04-09 21:51:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:13,476 INFO L93 Difference]: Finished difference Result 500 states and 550 transitions. [2018-04-09 21:51:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:51:13,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-04-09 21:51:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:13,478 INFO L225 Difference]: With dead ends: 500 [2018-04-09 21:51:13,478 INFO L226 Difference]: Without dead ends: 499 [2018-04-09 21:51:13,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:51:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-09 21:51:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 421. [2018-04-09 21:51:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-09 21:51:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 471 transitions. [2018-04-09 21:51:13,492 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 471 transitions. Word has length 73 [2018-04-09 21:51:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:13,492 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 471 transitions. [2018-04-09 21:51:13,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:51:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 471 transitions. [2018-04-09 21:51:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 21:51:13,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:13,493 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 21:51:13,493 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash -115912005, now seen corresponding path program 1 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-09 21:51:13,500 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:13,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:13,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:13,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:51:13,550 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-09 21:51:13,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:13,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,563 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-09 21:51:13,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:51:13,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,574 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-09 21:51:13,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-04-09 21:51:13,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-04-09 21:51:13,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-04-09 21:51:13,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:51:13,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 32 [2018-04-09 21:51:13,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-09 21:51:13,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-09 21:51:13,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-09 21:51:13,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:51:13,700 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-04-09 21:51:13,728 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 28 treesize of output 28 [2018-04-09 21:51:13,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 17 [2018-04-09 21:51:13,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-04-09 21:51:13,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-04-09 21:51:13,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,773 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 35 treesize of output 33 [2018-04-09 21:51:13,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-04-09 21:51:13,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,789 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 9 [2018-04-09 21:51:13,789 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,796 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:13,800 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-09 21:51:13,800 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-04-09 21:51:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:13,820 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:14,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:14,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-09 21:51:14,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 21:51:14,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 21:51:14,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=279, Unknown=4, NotChecked=0, Total=342 [2018-04-09 21:51:14,293 INFO L87 Difference]: Start difference. First operand 421 states and 471 transitions. Second operand 19 states. [2018-04-09 21:51:15,251 WARN L148 SmtUtils]: Spent 294ms on a formula simplification that was a NOOP. DAG size: 24 [2018-04-09 21:51:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:15,363 INFO L93 Difference]: Finished difference Result 628 states and 728 transitions. [2018-04-09 21:51:15,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:51:15,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-04-09 21:51:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:15,365 INFO L225 Difference]: With dead ends: 628 [2018-04-09 21:51:15,365 INFO L226 Difference]: Without dead ends: 627 [2018-04-09 21:51:15,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=663, Unknown=5, NotChecked=0, Total=870 [2018-04-09 21:51:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-04-09 21:51:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 381. [2018-04-09 21:51:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-09 21:51:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 429 transitions. [2018-04-09 21:51:15,382 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 429 transitions. Word has length 73 [2018-04-09 21:51:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:15,382 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 429 transitions. [2018-04-09 21:51:15,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 21:51:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 429 transitions. [2018-04-09 21:51:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 21:51:15,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:15,383 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] [2018-04-09 21:51:15,384 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1289367428, 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-09 21:51:15,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:15,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,439 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:15,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-09 21:51:15,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:51:15,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:51:15,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:51:15,478 INFO L87 Difference]: Start difference. First operand 381 states and 429 transitions. Second operand 6 states. [2018-04-09 21:51:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:15,526 INFO L93 Difference]: Finished difference Result 486 states and 552 transitions. [2018-04-09 21:51:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:51:15,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-04-09 21:51:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:15,528 INFO L225 Difference]: With dead ends: 486 [2018-04-09 21:51:15,528 INFO L226 Difference]: Without dead ends: 411 [2018-04-09 21:51:15,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:51:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-09 21:51:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 403. [2018-04-09 21:51:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-09 21:51:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 466 transitions. [2018-04-09 21:51:15,542 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 466 transitions. Word has length 74 [2018-04-09 21:51:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:15,543 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 466 transitions. [2018-04-09 21:51:15,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:51:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 466 transitions. [2018-04-09 21:51:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 21:51:15,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:15,543 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] [2018-04-09 21:51:15,543 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash -870060919, 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-09 21:51:15,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:15,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,602 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:15,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-09 21:51:15,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:51:15,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:51:15,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:15,643 INFO L87 Difference]: Start difference. First operand 403 states and 466 transitions. Second operand 8 states. [2018-04-09 21:51:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:15,715 INFO L93 Difference]: Finished difference Result 908 states and 1043 transitions. [2018-04-09 21:51:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 21:51:15,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-04-09 21:51:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:15,717 INFO L225 Difference]: With dead ends: 908 [2018-04-09 21:51:15,717 INFO L226 Difference]: Without dead ends: 577 [2018-04-09 21:51:15,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:51:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-04-09 21:51:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 538. [2018-04-09 21:51:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-04-09 21:51:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 604 transitions. [2018-04-09 21:51:15,734 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 604 transitions. Word has length 79 [2018-04-09 21:51:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:15,734 INFO L459 AbstractCegarLoop]: Abstraction has 538 states and 604 transitions. [2018-04-09 21:51:15,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:51:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 604 transitions. [2018-04-09 21:51:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 21:51:15,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:15,735 INFO L355 BasicCegarLoop]: trace histogram [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-09 21:51:15,735 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 946542118, now seen corresponding path program 1 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-09 21:51:15,741 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:15,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:15,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:15,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:15,776 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-09 21:51:15,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:15,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:51:15,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:15,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:15,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-09 21:51:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,875 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:15,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:15,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-04-09 21:51:15,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:51:15,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:51:15,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:15,986 INFO L87 Difference]: Start difference. First operand 538 states and 604 transitions. Second operand 9 states. [2018-04-09 21:51:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:16,274 INFO L93 Difference]: Finished difference Result 700 states and 782 transitions. [2018-04-09 21:51:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 21:51:16,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-04-09 21:51:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:16,277 INFO L225 Difference]: With dead ends: 700 [2018-04-09 21:51:16,277 INFO L226 Difference]: Without dead ends: 699 [2018-04-09 21:51:16,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:51:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-04-09 21:51:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 538. [2018-04-09 21:51:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-04-09 21:51:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 602 transitions. [2018-04-09 21:51:16,301 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 602 transitions. Word has length 81 [2018-04-09 21:51:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:16,302 INFO L459 AbstractCegarLoop]: Abstraction has 538 states and 602 transitions. [2018-04-09 21:51:16,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:51:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 602 transitions. [2018-04-09 21:51:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-09 21:51:16,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:16,302 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:16,303 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -810426508, now seen corresponding path program 1 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-09 21:51:16,310 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:16,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:16,418 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:16,449 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 16 treesize of output 20 [2018-04-09 21:51:16,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:51:16,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 14 treesize of output 12 [2018-04-09 21:51:16,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:16,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:51:16,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:14 [2018-04-09 21:51:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:16,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:16,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-04-09 21:51:16,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:51:16,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:51:16,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:51:16,526 INFO L87 Difference]: Start difference. First operand 538 states and 602 transitions. Second operand 13 states. [2018-04-09 21:51:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:17,043 INFO L93 Difference]: Finished difference Result 696 states and 770 transitions. [2018-04-09 21:51:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:51:17,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-04-09 21:51:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:17,045 INFO L225 Difference]: With dead ends: 696 [2018-04-09 21:51:17,045 INFO L226 Difference]: Without dead ends: 695 [2018-04-09 21:51:17,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2018-04-09 21:51:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-04-09 21:51:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 677. [2018-04-09 21:51:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-04-09 21:51:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 751 transitions. [2018-04-09 21:51:17,066 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 751 transitions. Word has length 90 [2018-04-09 21:51:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:17,066 INFO L459 AbstractCegarLoop]: Abstraction has 677 states and 751 transitions. [2018-04-09 21:51:17,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:51:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 751 transitions. [2018-04-09 21:51:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-09 21:51:17,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:17,067 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:17,067 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1477196513, now seen corresponding path program 1 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-09 21:51:17,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:17,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:17,109 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-09 21:51:17,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 8 treesize of output 7 [2018-04-09 21:51:17,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,115 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-09 21:51:17,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 21:51:17,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 17 treesize of output 13 [2018-04-09 21:51:17,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:51:17,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,131 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-09 21:51:17,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 21:51:17,145 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-09 21:51:17,145 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:17,156 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-09 21:51:17,176 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:17,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-09 21:51:17,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:51:17,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:51:17,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:17,177 INFO L87 Difference]: Start difference. First operand 677 states and 751 transitions. Second operand 8 states. [2018-04-09 21:51:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:17,384 INFO L93 Difference]: Finished difference Result 736 states and 812 transitions. [2018-04-09 21:51:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:51:17,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-04-09 21:51:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:17,386 INFO L225 Difference]: With dead ends: 736 [2018-04-09 21:51:17,386 INFO L226 Difference]: Without dead ends: 735 [2018-04-09 21:51:17,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:51:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-04-09 21:51:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 687. [2018-04-09 21:51:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-04-09 21:51:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 765 transitions. [2018-04-09 21:51:17,407 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 765 transitions. Word has length 90 [2018-04-09 21:51:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:17,408 INFO L459 AbstractCegarLoop]: Abstraction has 687 states and 765 transitions. [2018-04-09 21:51:17,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:51:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 765 transitions. [2018-04-09 21:51:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-09 21:51:17,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:17,408 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:17,408 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1477196514, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:17,414 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:17,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:17,498 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-09 21:51:17,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:51:17,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,511 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-09 21:51:17,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:17,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,521 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-09 21:51:17,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-04-09 21:51:17,560 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-09 21:51:17,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:51:17,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,570 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 25 [2018-04-09 21:51:17,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14 [2018-04-09 21:51:17,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,580 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-09 21:51:17,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-04-09 21:51:17,616 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-09 21:51:17,616 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:17,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-04-09 21:51:17,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:17,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-04-09 21:51:17,743 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-09 21:51:17,765 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:17,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 20 [2018-04-09 21:51:17,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:51:17,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:51:17,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:51:17,766 INFO L87 Difference]: Start difference. First operand 687 states and 765 transitions. Second operand 21 states. [2018-04-09 21:51:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:19,287 INFO L93 Difference]: Finished difference Result 987 states and 1110 transitions. [2018-04-09 21:51:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-09 21:51:19,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2018-04-09 21:51:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:19,291 INFO L225 Difference]: With dead ends: 987 [2018-04-09 21:51:19,291 INFO L226 Difference]: Without dead ends: 986 [2018-04-09 21:51:19,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=668, Invalid=2088, Unknown=0, NotChecked=0, Total=2756 [2018-04-09 21:51:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-04-09 21:51:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 687. [2018-04-09 21:51:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-04-09 21:51:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 763 transitions. [2018-04-09 21:51:19,332 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 763 transitions. Word has length 90 [2018-04-09 21:51:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:19,332 INFO L459 AbstractCegarLoop]: Abstraction has 687 states and 763 transitions. [2018-04-09 21:51:19,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:51:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 763 transitions. [2018-04-09 21:51:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-09 21:51:19,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:19,334 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:19,334 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1404834644, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:19,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:19,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:51:19,445 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:19,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 21:51:19,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:51:19,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 12 treesize of output 10 [2018-04-09 21:51:19,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:19,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:51:19,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:12 [2018-04-09 21:51:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:51:19,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:19,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-04-09 21:51:19,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:51:19,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:51:19,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:51:19,553 INFO L87 Difference]: Start difference. First operand 687 states and 763 transitions. Second operand 8 states. [2018-04-09 21:51:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:19,733 INFO L93 Difference]: Finished difference Result 708 states and 776 transitions. [2018-04-09 21:51:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:51:19,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-04-09 21:51:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:19,735 INFO L225 Difference]: With dead ends: 708 [2018-04-09 21:51:19,735 INFO L226 Difference]: Without dead ends: 707 [2018-04-09 21:51:19,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:51:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-04-09 21:51:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 687. [2018-04-09 21:51:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-04-09 21:51:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 762 transitions. [2018-04-09 21:51:19,757 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 762 transitions. Word has length 93 [2018-04-09 21:51:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:19,757 INFO L459 AbstractCegarLoop]: Abstraction has 687 states and 762 transitions. [2018-04-09 21:51:19,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:51:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 762 transitions. [2018-04-09 21:51:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-09 21:51:19,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:19,758 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:19,758 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 926548978, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:19,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:19,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-09 21:51:19,798 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:19,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-09 21:51:19,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:19,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:19,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 21:51:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-09 21:51:19,827 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:19,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:51:19,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:51:19,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:51:19,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:51:19,828 INFO L87 Difference]: Start difference. First operand 687 states and 762 transitions. Second operand 4 states. [2018-04-09 21:51:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:19,889 INFO L93 Difference]: Finished difference Result 716 states and 798 transitions. [2018-04-09 21:51:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:51:19,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-04-09 21:51:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:19,891 INFO L225 Difference]: With dead ends: 716 [2018-04-09 21:51:19,891 INFO L226 Difference]: Without dead ends: 714 [2018-04-09 21:51:19,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:51:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-04-09 21:51:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 685. [2018-04-09 21:51:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-04-09 21:51:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 753 transitions. [2018-04-09 21:51:19,915 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 753 transitions. Word has length 93 [2018-04-09 21:51:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:19,915 INFO L459 AbstractCegarLoop]: Abstraction has 685 states and 753 transitions. [2018-04-09 21:51:19,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:51:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 753 transitions. [2018-04-09 21:51:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-09 21:51:19,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:19,916 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:19,916 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash 926548979, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:19,922 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:19,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:20,021 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-09 21:51:20,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:20,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,055 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-09 21:51:20,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:51:20,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,068 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-09 21:51:20,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-04-09 21:51:20,112 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-09 21:51:20,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-09 21:51:20,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,194 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 25 [2018-04-09 21:51:20,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-04-09 21:51:20,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:20,271 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-09 21:51:20,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-04-09 21:51:20,358 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-09 21:51:20,358 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:20,518 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-09 21:51:20,540 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:51:20,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 9] imperfect sequences [] total 23 [2018-04-09 21:51:20,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 21:51:20,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 21:51:20,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-04-09 21:51:20,541 INFO L87 Difference]: Start difference. First operand 685 states and 753 transitions. Second operand 24 states. [2018-04-09 21:51:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:21,913 INFO L93 Difference]: Finished difference Result 1130 states and 1252 transitions. [2018-04-09 21:51:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-09 21:51:21,913 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-04-09 21:51:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:21,916 INFO L225 Difference]: With dead ends: 1130 [2018-04-09 21:51:21,916 INFO L226 Difference]: Without dead ends: 1128 [2018-04-09 21:51:21,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2018-04-09 21:51:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-04-09 21:51:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 697. [2018-04-09 21:51:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-04-09 21:51:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 767 transitions. [2018-04-09 21:51:21,943 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 767 transitions. Word has length 93 [2018-04-09 21:51:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:21,944 INFO L459 AbstractCegarLoop]: Abstraction has 697 states and 767 transitions. [2018-04-09 21:51:21,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 21:51:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 767 transitions. [2018-04-09 21:51:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-09 21:51:21,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:21,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:21,945 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 264952656, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:21,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:21,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:21,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:21,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:21,988 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-09 21:51:21,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:21,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:21,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:51:21,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:51:21,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:51:21,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:21,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,001 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-09 21:51:22,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-04-09 21:51:22,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 21:51:22,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-09 21:51:22,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,019 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-09 21:51:22,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-09 21:51:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:22,036 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:22,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:22,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-04-09 21:51:22,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:51:22,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:51:22,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:51:22,075 INFO L87 Difference]: Start difference. First operand 697 states and 767 transitions. Second operand 11 states. [2018-04-09 21:51:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:22,414 INFO L93 Difference]: Finished difference Result 1035 states and 1142 transitions. [2018-04-09 21:51:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:51:22,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-04-09 21:51:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:22,417 INFO L225 Difference]: With dead ends: 1035 [2018-04-09 21:51:22,417 INFO L226 Difference]: Without dead ends: 977 [2018-04-09 21:51:22,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:51:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-04-09 21:51:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 697. [2018-04-09 21:51:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-04-09 21:51:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 765 transitions. [2018-04-09 21:51:22,441 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 765 transitions. Word has length 95 [2018-04-09 21:51:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:22,441 INFO L459 AbstractCegarLoop]: Abstraction has 697 states and 765 transitions. [2018-04-09 21:51:22,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:51:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 765 transitions. [2018-04-09 21:51:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-09 21:51:22,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:22,442 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:51:22,442 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 138757367, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:22,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:22,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:22,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:22,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:51:22,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:22,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:22,508 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-09 21:51:22,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-09 21:51:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-09 21:51:22,556 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:22,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 21:51:22,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-09 21:51:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-09 21:51:22,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:22,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-04-09 21:51:22,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:51:22,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:51:22,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:51:22,660 INFO L87 Difference]: Start difference. First operand 697 states and 765 transitions. Second operand 9 states. [2018-04-09 21:51:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:22,808 INFO L93 Difference]: Finished difference Result 867 states and 952 transitions. [2018-04-09 21:51:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:51:22,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-04-09 21:51:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:22,811 INFO L225 Difference]: With dead ends: 867 [2018-04-09 21:51:22,811 INFO L226 Difference]: Without dead ends: 866 [2018-04-09 21:51:22,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:51:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-04-09 21:51:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 690. [2018-04-09 21:51:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-04-09 21:51:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 756 transitions. [2018-04-09 21:51:22,835 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 756 transitions. Word has length 98 [2018-04-09 21:51:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:22,835 INFO L459 AbstractCegarLoop]: Abstraction has 690 states and 756 transitions. [2018-04-09 21:51:22,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:51:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 756 transitions. [2018-04-09 21:51:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-09 21:51:22,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:22,837 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, 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-09 21:51:22,837 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1481111213, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:22,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:22,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:22,889 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-09 21:51:22,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:22,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:51:22,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:22,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-09 21:51:22,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:22,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:22,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:22,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:22,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:22,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:22,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-09 21:51:23,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:51:23,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-04-09 21:51:23,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:51:23,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:23,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:51:23,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:23,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-04-09 21:51:23,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-09 21:51:23,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:51:23,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-09 21:51:23,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:51:23,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-04-09 21:51:23,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-04-09 21:51:23,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:23,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-04-09 21:51:23,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2018-04-09 21:51:23,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-04-09 21:51:23,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:107 [2018-04-09 21:51:23,365 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 55 treesize of output 50 [2018-04-09 21:51:23,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,376 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:23,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:51:23,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-04-09 21:51:23,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,458 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-04-09 21:51:23,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:23,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:133, output treesize:131 [2018-04-09 21:51:23,567 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 70 treesize of output 67 [2018-04-09 21:51:23,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:23,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-04-09 21:51:23,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:23,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-04-09 21:51:23,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:23,673 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 93 [2018-04-09 21:51:23,680 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-04-09 21:51:23,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:51:23,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:51:23,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:444 [2018-04-09 21:51:24,178 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-09 21:51:24,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 327 [2018-04-09 21:51:24,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,238 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 306 [2018-04-09 21:51:24,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:24,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:24,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 325 [2018-04-09 21:51:24,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:24,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:24,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 263 [2018-04-09 21:51:24,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:24,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:25,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 306 [2018-04-09 21:51:25,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:25,437 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 304 [2018-04-09 21:51:25,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:25,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:26,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 289 [2018-04-09 21:51:26,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:26,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 265 [2018-04-09 21:51:26,020 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:26,062 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:26,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 259 [2018-04-09 21:51:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:26,544 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 301 [2018-04-09 21:51:26,545 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:26,638 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:27,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 299 [2018-04-09 21:51:27,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:27,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-04-09 21:51:27,152 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,192 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,198 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 327 treesize of output 294 [2018-04-09 21:51:27,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:27,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-04-09 21:51:27,205 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,245 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,252 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 331 treesize of output 308 [2018-04-09 21:51:27,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:27,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:27,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-04-09 21:51:27,261 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,302 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:27,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-04-09 21:51:27,661 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:1017, output treesize:2576 [2018-04-09 21:51:29,509 WARN L151 SmtUtils]: Spent 1777ms on a formula simplification. DAG size of input: 241 DAG size of output 132 [2018-04-09 21:51:29,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 289 [2018-04-09 21:51:29,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,743 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 179 treesize of output 300 [2018-04-09 21:51:29,743 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:51:29,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-04-09 21:51:29,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 238 [2018-04-09 21:51:29,892 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-09 21:51:29,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 290 [2018-04-09 21:51:29,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:30,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:30,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,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 293 treesize of output 237 [2018-04-09 21:51:30,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:30,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, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 123 [2018-04-09 21:51:30,226 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:30,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-09 21:51:30,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:30,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:30,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 93 [2018-04-09 21:51:30,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,501 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 146 [2018-04-09 21:51:30,502 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:51:30,529 INFO L267 ElimStorePlain]: Start of recursive call 10: 41 dim-0 vars, End of recursive call: 41 dim-0 vars, and 45 xjuncts. [2018-04-09 21:51:30,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:30,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 49 [2018-04-09 21:51:30,749 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:30,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-09 21:51:30,751 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:51:30,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:31,002 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 210 treesize of output 164 [2018-04-09 21:51:31,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 110 [2018-04-09 21:51:31,012 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:31,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 46 [2018-04-09 21:51:31,075 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,094 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 170 [2018-04-09 21:51:31,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 110 [2018-04-09 21:51:31,116 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:31,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 64 [2018-04-09 21:51:31,153 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,173 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,176 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 186 treesize of output 146 [2018-04-09 21:51:31,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:31,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 62 [2018-04-09 21:51:31,183 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-09 21:51:31,213 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,231 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,359 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 271 treesize of output 221 [2018-04-09 21:51:31,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2018-04-09 21:51:31,368 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:31,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2018-04-09 21:51:31,401 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,418 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,526 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 112 treesize of output 80 [2018-04-09 21:51:31,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:31,561 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 140 [2018-04-09 21:51:31,561 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:51:31,579 INFO L267 ElimStorePlain]: Start of recursive call 26: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 43 xjuncts. [2018-04-09 21:51:31,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-04-09 21:51:31,758 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-04-09 21:51:31,765 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-09 21:51:31,783 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:31,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-09 21:51:31,877 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:899, output treesize:148 [2018-04-09 21:51:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:32,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:33,159 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 230 treesize of output 225 [2018-04-09 21:51:33,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:33,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 225 [2018-04-09 21:51:33,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:33,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:33,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:461, output treesize:445 [2018-04-09 21:51:33,927 WARN L148 SmtUtils]: Spent 338ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-09 21:51:35,897 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 363 treesize of output 244 [2018-04-09 21:51:35,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:51:35,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:35,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,950 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 108 treesize of output 105 [2018-04-09 21:51:35,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:35,975 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-09 21:51:35,977 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-04-09 21:51:35,981 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,981 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:35,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 79 [2018-04-09 21:51:35,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:35,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-09 21:51:36,037 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,037 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,038 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,038 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,039 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78 [2018-04-09 21:51:36,040 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,041 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:51:36,041 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,054 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 44 treesize of output 34 [2018-04-09 21:51:36,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,058 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,058 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-04-09 21:51:36,059 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,064 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,067 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,152 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 359 treesize of output 304 [2018-04-09 21:51:36,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:51:36,231 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,257 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,258 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 108 treesize of output 105 [2018-04-09 21:51:36,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-09 21:51:36,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-04-09 21:51:36,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,292 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 79 [2018-04-09 21:51:36,293 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,302 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,311 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,331 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 52 [2018-04-09 21:51:36,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,361 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 74 [2018-04-09 21:51:36,362 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,389 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 56 treesize of output 44 [2018-04-09 21:51:36,413 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-04-09 21:51:36,416 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,434 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,447 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-09 21:51:36,460 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-09 21:51:36,484 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,537 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 204 treesize of output 149 [2018-04-09 21:51:36,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:51:36,586 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 105 [2018-04-09 21:51:36,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,651 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 109 [2018-04-09 21:51:36,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 110 [2018-04-09 21:51:36,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2018-04-09 21:51:36,727 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 62 [2018-04-09 21:51:36,752 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,771 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:51:36,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:36,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-04-09 21:51:36,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-04-09 21:51:36,819 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,827 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,844 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-09 21:51:36,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:36,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-09 21:51:36,854 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,855 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,856 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-09 21:51:36,866 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-09 21:51:36,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:36,883 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 9 variables, input treesize:727, output treesize:16 [2018-04-09 21:51:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:37,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:51:37,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-09 21:51:37,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 21:51:37,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 21:51:37,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2018-04-09 21:51:37,051 INFO L87 Difference]: Start difference. First operand 690 states and 756 transitions. Second operand 35 states. [2018-04-09 21:51:39,229 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 111 DAG size of output 87 [2018-04-09 21:51:39,539 WARN L148 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-09 21:51:41,557 WARN L151 SmtUtils]: Spent 529ms on a formula simplification. DAG size of input: 269 DAG size of output 161 [2018-04-09 21:51:45,155 WARN L151 SmtUtils]: Spent 1272ms on a formula simplification. DAG size of input: 387 DAG size of output 279 [2018-04-09 21:51:46,971 WARN L151 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 170 DAG size of output 161 [2018-04-09 21:51:48,369 WARN L151 SmtUtils]: Spent 1008ms on a formula simplification. DAG size of input: 106 DAG size of output 74 [2018-04-09 21:51:48,888 WARN L151 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 181 DAG size of output 170 [2018-04-09 21:51:49,444 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 170 DAG size of output 161 [2018-04-09 21:51:49,915 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 170 DAG size of output 157 [2018-04-09 21:51:51,051 WARN L151 SmtUtils]: Spent 376ms on a formula simplification. DAG size of input: 225 DAG size of output 216 [2018-04-09 21:51:52,000 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 116 DAG size of output 65 [2018-04-09 21:51:53,064 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 155 [2018-04-09 21:51:55,075 WARN L151 SmtUtils]: Spent 605ms on a formula simplification. DAG size of input: 128 DAG size of output 77 [2018-04-09 21:51:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:51:55,640 INFO L93 Difference]: Finished difference Result 1075 states and 1169 transitions. [2018-04-09 21:51:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-09 21:51:55,640 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-04-09 21:51:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:51:55,643 INFO L225 Difference]: With dead ends: 1075 [2018-04-09 21:51:55,643 INFO L226 Difference]: Without dead ends: 1074 [2018-04-09 21:51:55,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1096, Invalid=5224, Unknown=0, NotChecked=0, Total=6320 [2018-04-09 21:51:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-04-09 21:51:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 805. [2018-04-09 21:51:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2018-04-09 21:51:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 883 transitions. [2018-04-09 21:51:55,678 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 883 transitions. Word has length 99 [2018-04-09 21:51:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:51:55,678 INFO L459 AbstractCegarLoop]: Abstraction has 805 states and 883 transitions. [2018-04-09 21:51:55,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 21:51:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 883 transitions. [2018-04-09 21:51:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-09 21:51:55,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:51:55,680 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, 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-09 21:51:55,680 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-09 21:51:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1481111212, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:51:55,701 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:51:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:51:55,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:51:55,753 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-09 21:51:55,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:55,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,767 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-09 21:51:55,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:51:55,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-09 21:51:55,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:55,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:55,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:55,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:51:55,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:55,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:51:55,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-09 21:51:55,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:55,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:55,884 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-09 21:51:55,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:52 [2018-04-09 21:51:55,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:51:55,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:51:55,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-04-09 21:51:55,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:51:55,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:55,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:82 [2018-04-09 21:51:56,020 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 67 treesize of output 66 [2018-04-09 21:51:56,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:51:56,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-04-09 21:51:56,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:51:56,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-04-09 21:51:56,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-04-09 21:51:56,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-04-09 21:51:56,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,183 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 58 treesize of output 61 [2018-04-09 21:51:56,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:56,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-04-09 21:51:56,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:117 [2018-04-09 21:51:56,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,264 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 83 treesize of output 95 [2018-04-09 21:51:56,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,297 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-04-09 21:51:56,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:56,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-09 21:51:56,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:56,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:51:56,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:141 [2018-04-09 21:51:56,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2018-04-09 21:51:56,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:56,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 77 [2018-04-09 21:51:56,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 115 [2018-04-09 21:51:56,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,569 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 118 [2018-04-09 21:51:56,570 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:51:56,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:167, output treesize:165 [2018-04-09 21:51:56,699 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 417 treesize of output 384 [2018-04-09 21:51:56,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,707 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:56,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 395 [2018-04-09 21:51:56,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:56,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 382 [2018-04-09 21:51:56,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:56,829 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 433 [2018-04-09 21:51:56,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:56,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:57,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:57,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:452, output treesize:1201 [2018-04-09 21:51:57,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 312 [2018-04-09 21:51:57,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,221 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 392 [2018-04-09 21:51:57,222 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-09 21:51:57,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 50 dim-0 vars, End of recursive call: 50 dim-0 vars, and 54 xjuncts. [2018-04-09 21:51:57,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 165 [2018-04-09 21:51:57,480 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-09 21:51:57,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 191 [2018-04-09 21:51:57,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:51:57,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-09 21:51:57,704 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 152 treesize of output 114 [2018-04-09 21:51:57,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,709 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:57,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 81 [2018-04-09 21:51:57,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-04-09 21:51:57,736 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,751 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 160 treesize of output 122 [2018-04-09 21:51:57,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 91 [2018-04-09 21:51:57,761 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,782 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:57,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-04-09 21:51:57,784 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,795 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 120 [2018-04-09 21:51:57,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 91 [2018-04-09 21:51:57,806 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:57,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-04-09 21:51:57,830 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,844 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,847 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 156 treesize of output 118 [2018-04-09 21:51:57,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:51:57,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 79 [2018-04-09 21:51:57,853 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:51:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-04-09 21:51:57,879 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,890 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:51:57,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:51:57,929 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:403, output treesize:31 [2018-04-09 21:51:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:51:58,042 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:51:59,118 WARN L148 SmtUtils]: Spent 605ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 21:52:06,266 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 198 treesize of output 143 [2018-04-09 21:52:06,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:52:06,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,319 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 108 treesize of output 105 [2018-04-09 21:52:06,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:52:06,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-04-09 21:52:06,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-04-09 21:52:06,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2018-04-09 21:52:06,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,383 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 23 [2018-04-09 21:52:06,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,387 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 23 treesize of output 21 [2018-04-09 21:52:06,387 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,389 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,456 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 189 treesize of output 134 [2018-04-09 21:52:06,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:52:06,496 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 89 [2018-04-09 21:52:06,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 83 [2018-04-09 21:52:06,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:52:06,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 94 [2018-04-09 21:52:06,568 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,568 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 111 [2018-04-09 21:52:06,579 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-09 21:52:06,627 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:52:06,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:52:06,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 45 [2018-04-09 21:52:06,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2018-04-09 21:52:06,664 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,674 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,697 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:52:06,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 60 [2018-04-09 21:52:06,766 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,769 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,769 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 113 [2018-04-09 21:52:06,771 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-04-09 21:52:06,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-04-09 21:52:06,823 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,837 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,840 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-09 21:52:06,842 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 35 treesize of output 29 [2018-04-09 21:52:06,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:52:06,845 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,849 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,851 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 35 treesize of output 29 [2018-04-09 21:52:06,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,854 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:52:06,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-09 21:52:06,854 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,864 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:52:06,871 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:52:06,883 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:52:06,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:52:06,922 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:397, output treesize:56 [2018-04-09 21:52:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:52:07,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:52:07,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-04-09 21:52:07,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 21:52:07,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 21:52:07,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=984, Unknown=3, NotChecked=0, Total=1190 [2018-04-09 21:52:07,104 INFO L87 Difference]: Start difference. First operand 805 states and 883 transitions. Second operand 35 states. [2018-04-09 21:52:08,888 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 122 DAG size of output 79 [2018-04-09 21:52:09,201 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 110 DAG size of output 98 [2018-04-09 21:52:28,244 WARN L151 SmtUtils]: Spent 12895ms on a formula simplification. DAG size of input: 260 DAG size of output 136 [2018-04-09 21:52:30,423 WARN L151 SmtUtils]: Spent 434ms on a formula simplification. DAG size of input: 188 DAG size of output 130 [2018-04-09 21:52:32,465 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_$Pointer$.base| c_main_~x~1.base)) (.cse33 (+ c_main_~x~1.offset 4)) (.cse1 (select |c_#memory_$Pointer$.base| c_main_~first~0.base)) (.cse18 (+ c_main_~first~0.offset 4))) (let ((.cse17 (select .cse1 .cse18)) (.cse20 (select .cse32 .cse33)) (.cse13 (select |c_#memory_$Pointer$.offset| c_main_~x~0.base)) (.cse19 (+ c_main_~x~0.offset 16)) (.cse27 (+ c_main_~last~0.offset 12)) (.cse0 (select |c_#memory_$Pointer$.base| c_main_~x~0.base)) (.cse14 (+ c_main_~x~0.offset 4))) (and (<= |c_main_#t~malloc3.offset| 0) (= (select .cse0 c_main_~x~0.offset) c_main_~x~0.base) (= c_main_~first~0.base (select .cse1 c_main_~first~0.offset)) (<= c_main_~first~0.offset 0) (exists ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| c_main_~first~0.base))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| (select .cse7 (+ c_main_~first~0.offset 4)))) (.cse12 (+ v_prenex_148 12))) (let ((.cse2 (select .cse9 .cse12)) (.cse3 (select .cse7 .cse12))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse10 (+ .cse2 12))) (let ((.cse8 (+ .cse2 16)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3)) (.cse11 (+ .cse2 4)) (.cse5 (select .cse6 .cse10))) (and (= 0 .cse2) (= .cse3 (select .cse4 .cse2)) (= .cse5 .cse2) (= (select .cse6 .cse2) .cse2) (not (= (select .cse4 v_prenex_147) (select .cse7 v_prenex_147))) (= c_main_~first~0.base (select .cse4 .cse8)) (<= c_main_~first~0.offset v_prenex_148) (= (select .cse9 .cse2) c_main_~first~0.offset) (= (select .cse4 .cse10) 0) (not (= .cse8 v_prenex_147)) (= (select .cse6 .cse8) v_prenex_148) (= .cse3 (select .cse4 .cse11)) (= (select .cse6 .cse11) .cse5)))))))) (= c_main_~x~0.offset (select .cse13 .cse14)) (forall ((v_prenex_201 Int) (v_main_~last~0.offset_37 Int) (v_main_~x~0.offset_41 Int)) (or (= c_main_~first~0.base (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.base| v_prenex_201 (store (store (store (select |c_#memory_$Pointer$.base| v_prenex_201) (+ v_main_~x~0.offset_41 12) 0) v_main_~x~0.offset_41 v_prenex_201) (+ v_main_~x~0.offset_41 4) v_prenex_201)))) (store .cse16 c_main_~x~0.base (store (select .cse16 c_main_~x~0.base) (+ v_main_~last~0.offset_37 12) v_prenex_201))))) (store .cse15 v_prenex_201 (store (select .cse15 v_prenex_201) (+ v_main_~x~0.offset_41 16) c_main_~x~0.base))) c_main_~first~0.base) c_main_~first~0.offset)) (not (= 0 (select |c_#valid| v_prenex_201))) (< 0 v_main_~x~0.offset_41) (< v_main_~last~0.offset_37 c_main_~x~0.offset) (< v_main_~x~0.offset_41 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse17) .cse18) c_main_~first~0.offset) (<= 0 c_main_~x~1.offset) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store .cse13 .cse19 c_main_~last~0.offset)) c_main_~first~0.base) c_main_~first~0.offset) c_main_~first~0.offset) (= .cse20 c_main_~x~1.base) (<= 0 c_main_~first~0.offset) (forall ((v_prenex_200 Int)) (or (< v_prenex_200 0) (< |c_main_#t~malloc3.offset| v_prenex_200) (= (select (select (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_main_#t~malloc3.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_main_#t~malloc3.base|) (+ v_prenex_200 12) 0) v_prenex_200 v_prenex_200) (+ v_prenex_200 4) v_prenex_200)))) (store .cse22 c_main_~last~0.base (store (select .cse22 c_main_~last~0.base) (+ c_main_~last~0.offset 12) v_prenex_200))))) (store .cse21 |c_main_#t~malloc3.base| (store (select .cse21 |c_main_#t~malloc3.base|) (+ v_prenex_200 16) c_main_~last~0.offset))) c_main_~first~0.base) c_main_~first~0.offset) c_main_~first~0.offset))) (= c_main_~first~0.base .cse17) (forall ((v_prenex_200 Int) (|v_main_#t~malloc3.base_19| Int)) (or (< v_prenex_200 0) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_19|))) (< 0 v_prenex_200) (= (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_main_#t~malloc3.base_19| (store (store (store (select |c_#memory_$Pointer$.offset| |v_main_#t~malloc3.base_19|) (+ v_prenex_200 12) 0) v_prenex_200 v_prenex_200) (+ v_prenex_200 4) v_prenex_200)))) (store .cse24 c_main_~last~0.base (store (select .cse24 c_main_~last~0.base) (+ c_main_~last~0.offset 12) v_prenex_200))))) (store .cse23 |v_main_#t~malloc3.base_19| (store (select .cse23 |v_main_#t~malloc3.base_19|) (+ v_prenex_200 16) c_main_~last~0.offset))) c_main_~first~0.base) c_main_~first~0.offset) c_main_~first~0.offset))) (= (select (select (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store .cse13 .cse14 c_main_~x~0.offset)))) (store .cse26 c_main_~last~0.base (store (select .cse26 c_main_~last~0.base) .cse27 c_main_~x~0.offset))))) (store .cse25 c_main_~x~0.base (store (select .cse25 c_main_~x~0.base) .cse19 c_main_~last~0.offset))) c_main_~first~0.base) c_main_~first~0.offset) c_main_~first~0.offset) (<= c_main_~x~1.offset 0) (<= c_main_~x~0.offset 0) (forall ((v_prenex_201 Int) (v_main_~x~0.offset_41 Int)) (or (not (= 0 (select |c_#valid| v_prenex_201))) (< 0 v_main_~x~0.offset_41) (= c_main_~first~0.base (select (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.base| v_prenex_201 (store (store (store (select |c_#memory_$Pointer$.base| v_prenex_201) (+ v_main_~x~0.offset_41 12) 0) v_main_~x~0.offset_41 v_prenex_201) (+ v_main_~x~0.offset_41 4) v_prenex_201)))) (store .cse29 c_main_~last~0.base (store (select .cse29 c_main_~last~0.base) (+ c_main_~last~0.offset 12) v_prenex_201))))) (store .cse28 v_prenex_201 (store (select .cse28 v_prenex_201) (+ v_main_~x~0.offset_41 16) c_main_~last~0.base))) c_main_~first~0.base) c_main_~first~0.offset)) (< v_main_~x~0.offset_41 0))) (= 1 (select |c_#valid| c_main_~x~0.base)) (= (select .cse0 .cse14) c_main_~x~0.base) (forall ((v_main_~x~0.offset_41 Int)) (or (= c_main_~first~0.base (select (select (let ((.cse30 (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_main_#t~malloc3.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~malloc3.base|) (+ v_main_~x~0.offset_41 12) 0) v_main_~x~0.offset_41 |c_main_#t~malloc3.base|) (+ v_main_~x~0.offset_41 4) |c_main_#t~malloc3.base|)))) (store .cse31 c_main_~last~0.base (store (select .cse31 c_main_~last~0.base) (+ c_main_~last~0.offset 12) |c_main_#t~malloc3.base|))))) (store .cse30 |c_main_#t~malloc3.base| (store (select .cse30 |c_main_#t~malloc3.base|) (+ v_main_~x~0.offset_41 16) c_main_~last~0.base))) c_main_~first~0.base) c_main_~first~0.offset)) (< |c_main_#t~malloc3.offset| v_main_~x~0.offset_41) (< v_main_~x~0.offset_41 0))) (= (select .cse32 c_main_~x~1.offset) c_main_~x~1.base) (= c_main_~x~1.offset (select (select |c_#memory_$Pointer$.offset| .cse20) .cse33)) (= c_main_~first~0.base (select (select (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse0 .cse19 c_main_~last~0.base)) c_main_~first~0.base) c_main_~first~0.offset)) (or (< c_main_~x~0.offset 0) (let ((.cse36 (+ c_main_~x~0.offset 12))) (and (= c_main_~first~0.base (select (select (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (store (store .cse0 .cse36 0) c_main_~x~0.offset c_main_~x~0.base) .cse14 c_main_~x~0.base)))) (store .cse35 c_main_~last~0.base (store (select .cse35 c_main_~last~0.base) .cse27 c_main_~x~0.base))))) (store .cse34 c_main_~x~0.base (store (select .cse34 c_main_~x~0.base) .cse19 c_main_~last~0.base))) c_main_~first~0.base) c_main_~first~0.offset)) (= (select (select (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (store (store .cse13 .cse36 0) c_main_~x~0.offset c_main_~x~0.offset) .cse14 c_main_~x~0.offset)))) (store .cse38 c_main_~last~0.base (store (select .cse38 c_main_~last~0.base) .cse27 c_main_~x~0.offset))))) (store .cse37 c_main_~x~0.base (store (select .cse37 c_main_~x~0.base) .cse19 c_main_~last~0.offset))) c_main_~first~0.base) c_main_~first~0.offset) c_main_~first~0.offset)))) (forall ((v_prenex_203 Int) (v_prenex_200 Int) (|v_main_#t~malloc3.base_19| Int)) (or (< v_prenex_200 0) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_19|))) (< v_prenex_203 c_main_~x~0.offset) (< 0 v_prenex_200) (= c_main_~first~0.offset (select (select (let ((.cse39 (let ((.cse40 (store |c_#memory_$Pointer$.offset| |v_main_#t~malloc3.base_19| (store (store (store (select |c_#memory_$Pointer$.offset| |v_main_#t~malloc3.base_19|) (+ v_prenex_200 12) 0) v_prenex_200 v_prenex_200) (+ v_prenex_200 4) v_prenex_200)))) (store .cse40 c_main_~x~0.base (store (select .cse40 c_main_~x~0.base) (+ v_prenex_203 12) v_prenex_200))))) (store .cse39 |v_main_#t~malloc3.base_19| (store (select .cse39 |v_main_#t~malloc3.base_19|) (+ v_prenex_200 16) v_prenex_203))) c_main_~first~0.base) c_main_~first~0.offset)))) (exists ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse50 (select |c_#memory_$Pointer$.base| c_main_~x~1.base))) (let ((.cse41 (select |c_#memory_$Pointer$.offset| (select .cse50 (+ c_main_~x~1.offset 4)))) (.cse51 (+ v_prenex_148 12))) (let ((.cse42 (select .cse41 .cse51)) (.cse48 (select .cse50 .cse51))) (let ((.cse43 (select |c_#memory_$Pointer$.offset| .cse48)) (.cse46 (+ .cse42 12))) (let ((.cse47 (+ .cse42 4)) (.cse49 (select .cse43 .cse46)) (.cse44 (+ .cse42 16)) (.cse45 (select |c_#memory_$Pointer$.base| .cse48))) (and (= c_main_~x~1.offset (select .cse41 .cse42)) (= v_prenex_148 (select .cse43 .cse44)) (= (select .cse45 .cse46) 0) (= (select .cse45 .cse47) .cse48) (<= c_main_~x~1.offset v_prenex_148) (= .cse49 (select .cse43 .cse47)) (not (= v_prenex_147 .cse44)) (= (select .cse43 .cse42) .cse42) (not (= (select .cse45 v_prenex_147) (select .cse50 v_prenex_147))) (= .cse49 .cse42) (= (select .cse45 .cse44) c_main_~x~1.base) (= .cse48 (select .cse45 .cse42)) (= 0 .cse42)))))))) (= c_main_~x~0.offset (select .cse13 c_main_~x~0.offset)) (<= 0 c_main_~x~0.offset) (= c_main_~first~0.base (select (select (let ((.cse52 (let ((.cse53 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse0 .cse14 c_main_~x~0.base)))) (store .cse53 c_main_~last~0.base (store (select .cse53 c_main_~last~0.base) .cse27 c_main_~x~0.base))))) (store .cse52 c_main_~x~0.base (store (select .cse52 c_main_~x~0.base) .cse19 c_main_~last~0.base))) c_main_~first~0.base) c_main_~first~0.offset))))) is different from false [2018-04-09 21:52:33,883 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 92 DAG size of output 58 [2018-04-09 21:52:34,995 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 96 DAG size of output 59 [2018-04-09 21:53:58,285 WARN L151 SmtUtils]: Spent 19671ms on a formula simplification. DAG size of input: 160 DAG size of output 94 [2018-04-09 21:54:17,840 WARN L151 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 102 DAG size of output 65 Received shutdown request... [2018-04-09 21:55:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-09 21:55:24,682 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:55:24,686 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:55:24,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:55:24 BoogieIcfgContainer [2018-04-09 21:55:24,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:55:24,687 INFO L168 Benchmark]: Toolchain (without parser) took 264432.73 ms. Allocated memory was 305.7 MB in the beginning and 761.3 MB in the end (delta: 455.6 MB). Free memory was 243.4 MB in the beginning and 614.2 MB in the end (delta: -370.8 MB). Peak memory consumption was 84.9 MB. Max. memory is 5.3 GB. [2018-04-09 21:55:24,688 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:55:24,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.65 ms. Allocated memory is still 305.7 MB. Free memory was 243.4 MB in the beginning and 217.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:55:24,689 INFO L168 Benchmark]: Boogie Preprocessor took 61.03 ms. Allocated memory is still 305.7 MB. Free memory was 217.4 MB in the beginning and 215.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:55:24,689 INFO L168 Benchmark]: RCFGBuilder took 641.64 ms. Allocated memory was 305.7 MB in the beginning and 470.3 MB in the end (delta: 164.6 MB). Free memory was 215.5 MB in the beginning and 392.4 MB in the end (delta: -177.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-04-09 21:55:24,689 INFO L168 Benchmark]: TraceAbstraction took 263382.35 ms. Allocated memory was 470.3 MB in the beginning and 761.3 MB in the end (delta: 291.0 MB). Free memory was 392.4 MB in the beginning and 614.2 MB in the end (delta: -221.8 MB). Peak memory consumption was 69.2 MB. Max. memory is 5.3 GB. [2018-04-09 21:55:24,691 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.12 ms. Allocated memory is still 305.7 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 342.65 ms. Allocated memory is still 305.7 MB. Free memory was 243.4 MB in the beginning and 217.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.03 ms. Allocated memory is still 305.7 MB. Free memory was 217.4 MB in the beginning and 215.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 641.64 ms. Allocated memory was 305.7 MB in the beginning and 470.3 MB in the end (delta: 164.6 MB). Free memory was 215.5 MB in the beginning and 392.4 MB in the end (delta: -177.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 263382.35 ms. Allocated memory was 470.3 MB in the beginning and 761.3 MB in the end (delta: 291.0 MB). Free memory was 392.4 MB in the beginning and 614.2 MB in the end (delta: -221.8 MB). Peak memory consumption was 69.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (805states) and interpolant automaton (currently 42 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (718 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 41 error locations. TIMEOUT Result, 263.3s OverallTime, 42 OverallIterations, 3 TraceHistogramMax, 228.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5559 SDtfs, 14169 SDslu, 25732 SDs, 0 SdLazy, 11426 SolverSat, 726 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 132.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5555 GetRequests, 4915 SyntacticMatches, 26 SemanticMatches, 614 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 4362 ImplicationChecksByTransitivity, 110.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=41, 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.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 3577 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 2626 NumberOfCodeBlocks, 2626 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5168 ConstructedInterpolants, 347 QuantifiedInterpolants, 8031999 SizeOfPredicates, 271 NumberOfNonLiveVariables, 7275 ConjunctsInSsa, 502 ConjunctsInUnsatCore, 84 InterpolantComputations, 54 PerfectInterpolantSequences, 660/946 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/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-55-24-697.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-55-24-697.csv Completed graceful shutdown