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/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:45:01,634 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:45:01,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:45:01,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:45:01,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:45:01,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:45:01,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:45:01,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:45:01,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:45:01,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:45:01,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:45:01,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:45:01,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:45:01,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:45:01,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:45:01,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:45:01,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:45:01,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:45:01,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:45:01,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:45:01,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:45:01,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:45:01,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:45:01,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:45:01,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:45:01,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:45:01,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:45:01,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:45:01,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:45:01,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:45:01,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:45:01,680 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:45:01,705 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:45:01,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:45:01,705 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:45:01,705 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:45:01,706 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:45:01,706 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:45:01,706 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:45:01,707 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:45:01,707 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:45:01,707 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:45:01,707 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:45:01,708 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:45:01,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:45:01,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:45:01,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:45:01,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:45:01,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:45:01,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:45:01,710 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:45:01,710 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:45:01,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:45:01,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:45:01,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:45:01,711 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:45:01,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:45:01,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:45:01,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:45:01,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:45:01,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:45:01,713 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:45:01,713 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:45:01,713 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:45:01,713 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:45:01,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:45:01,761 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:45:01,765 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:45:01,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:45:01,767 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:45:01,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,082 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG565380f09 [2018-04-09 21:45:02,268 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:45:02,268 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:45:02,269 INFO L168 CDTParser]: Scanning 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,280 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:45:02,280 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:45:02,280 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:45:02,280 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,280 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f___________true_valid_memsafety_i__foo ('foo') in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,280 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint8_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____daddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____key_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_int in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__loff_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____clockid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__clockid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fd_mask in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_cond_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_spinlock_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__id_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____clock_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____WAIT_STATUS in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__dev_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_condattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_attr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____pid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ushort in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsblkcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__wchar_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__register_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____useconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____swblk_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_barrier_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____nlink_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__timer_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__sigset_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____gid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____sig_atomic_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__key_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ssize_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ino64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__nlink_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__uint in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ssize_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_rwlockattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____off_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blkcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fd_mask in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsfilcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____suseconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__time_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____rlim64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__caddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____id_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_rwlock_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____qaddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blksize_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,286 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__blksize_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__div_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint32_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsblkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____timer_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____off64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____time_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____intptr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_mutexattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,287 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__size_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsfilcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__n in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_char in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsblkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_key_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,288 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__lldiv_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____rlim_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____socklen_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__uid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____pthread_list_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_barrierattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__b in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__a in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ldiv_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsfilcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,289 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_mutex_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ino_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_short in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__off_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__gid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_char in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__blkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint16_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__daddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____mode_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_once_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_long in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____caddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ino_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____dev_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____loff_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____sigset_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fd_set in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_short in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__clock_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__suseconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__mode_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ulong in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_long in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pid_t in 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:02,314 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG565380f09 [2018-04-09 21:45:02,319 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:45:02,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:45:02,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:45:02,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:45:02,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:45:02,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9f5e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02, skipping insertion in model container [2018-04-09 21:45:02,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,344 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:45:02,375 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:45:02,541 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:45:02,594 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:45:02,604 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 21:45:02,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02 WrapperNode [2018-04-09 21:45:02,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:45:02,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:45:02,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:45:02,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:45:02,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (1/1) ... [2018-04-09 21:45:02,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:45:02,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:45:02,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:45:02,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:45:02,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (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:45:02,846 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:45:02,846 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:45:02,847 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-09 21:45:02,847 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:45:02,847 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:45:02,848 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:45:02,849 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:45:02,850 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:45:02,851 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:45:02,852 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:45:02,853 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:45:02,854 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:45:02,855 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:45:02,856 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:45:02,857 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:45:02,858 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:45:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:45:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 21:45:03,267 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:45:03,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:45:03 BoogieIcfgContainer [2018-04-09 21:45:03,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:45:03,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:45:03,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:45:03,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:45:03,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:45:02" (1/3) ... [2018-04-09 21:45:03,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa26df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:45:03, skipping insertion in model container [2018-04-09 21:45:03,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:45:02" (2/3) ... [2018-04-09 21:45:03,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa26df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:45:03, skipping insertion in model container [2018-04-09 21:45:03,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:45:03" (3/3) ... [2018-04-09 21:45:03,274 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-04-09 21:45:03,283 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:45:03,290 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-09 21:45:03,337 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:45:03,337 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:45:03,338 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:45:03,338 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:45:03,338 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:45:03,338 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:45:03,338 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:45:03,338 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:45:03,338 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:45:03,339 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:45:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-09 21:45:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 21:45:03,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:03,358 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:03,359 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1281560952, 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:45:03,375 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:03,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:03,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:03,460 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:45:03,483 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:03,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:45:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 21:45:03,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 21:45:03,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:45:03,497 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2018-04-09 21:45:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:03,521 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-09 21:45:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 21:45:03,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-04-09 21:45:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:03,532 INFO L225 Difference]: With dead ends: 156 [2018-04-09 21:45:03,533 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 21:45:03,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:45:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 21:45:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 21:45:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 21:45:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-04-09 21:45:03,575 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 18 [2018-04-09 21:45:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:03,575 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-04-09 21:45:03,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 21:45:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-04-09 21:45:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:45:03,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:03,576 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] [2018-04-09 21:45:03,576 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1181244051, 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:45:03,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:03,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:03,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:45:03,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:03,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:03,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:45: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:45:03,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:03,711 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:45:03,745 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:03,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:45:03,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:45:03,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:45:03,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:45:03,748 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 5 states. [2018-04-09 21:45:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:03,878 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-04-09 21:45:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:45:03,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-09 21:45:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:03,881 INFO L225 Difference]: With dead ends: 84 [2018-04-09 21:45:03,882 INFO L226 Difference]: Without dead ends: 80 [2018-04-09 21:45:03,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:45:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-09 21:45:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-09 21:45:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-09 21:45:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-04-09 21:45:03,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2018-04-09 21:45:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:03,897 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-04-09 21:45:03,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:45:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-04-09 21:45:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:45:03,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:03,899 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] [2018-04-09 21:45:03,899 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1181244052, 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:45:03,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:03,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:03,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:45:03,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:03,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:03,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:04,052 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:45:04,052 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:04,190 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:04,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 21:45:04,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:45:04,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:45:04,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:45:04,192 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 9 states. [2018-04-09 21:45:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:04,446 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-09 21:45:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:45:04,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-09 21:45:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:04,449 INFO L225 Difference]: With dead ends: 149 [2018-04-09 21:45:04,449 INFO L226 Difference]: Without dead ends: 148 [2018-04-09 21:45:04,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:45:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-09 21:45:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 91. [2018-04-09 21:45:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-09 21:45:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-04-09 21:45:04,462 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2018-04-09 21:45:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:04,462 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-04-09 21:45:04,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:45:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-04-09 21:45:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-09 21:45:04,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:04,464 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] [2018-04-09 21:45:04,464 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1417984840, 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:45:04,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:04,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:04,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 6 treesize of output 5 [2018-04-09 21:45:04,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:45:04,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:04,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 21:45:04,551 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:45:04,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:04,565 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:45:04,600 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:04,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:45:04,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:45:04,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:45:04,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:45:04,601 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 4 states. [2018-04-09 21:45:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:04,652 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-04-09 21:45:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:45:04,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-09 21:45:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:04,653 INFO L225 Difference]: With dead ends: 91 [2018-04-09 21:45:04,654 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 21:45:04,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 2 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:45:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 21:45:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-09 21:45:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-09 21:45:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-04-09 21:45:04,667 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 28 [2018-04-09 21:45:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:04,668 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-04-09 21:45:04,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:45:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-04-09 21:45:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-09 21:45:04,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:04,669 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] [2018-04-09 21:45:04,669 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1417984841, 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:45:04,678 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:04,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:04,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:45:04,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-09 21:45:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:04,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:04,804 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:45:04,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,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, 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 19 [2018-04-09 21:45:04,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:04,825 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:45:04,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 21:45:04,954 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:45:04,954 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:05,035 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 10 treesize of output 3 [2018-04-09 21:45:05,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:05,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-09 21:45:05,053 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 8 treesize of output 1 [2018-04-09 21:45:05,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:05,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:05,058 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:45:05,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-09 21:45:05,064 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:45:05,086 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:05,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-09 21:45:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:45:05,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:45:05,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:45:05,087 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-04-09 21:45:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:07,637 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2018-04-09 21:45:07,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 21:45:07,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-09 21:45:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:07,640 INFO L225 Difference]: With dead ends: 194 [2018-04-09 21:45:07,640 INFO L226 Difference]: Without dead ends: 153 [2018-04-09 21:45:07,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=301, Unknown=2, NotChecked=0, Total=420 [2018-04-09 21:45:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-09 21:45:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2018-04-09 21:45:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-09 21:45:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-04-09 21:45:07,657 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 28 [2018-04-09 21:45:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:07,657 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-04-09 21:45:07,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:45:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-04-09 21:45:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-09 21:45:07,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:07,658 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] [2018-04-09 21:45:07,658 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash -922220228, 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:45:07,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:07,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:07,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:07,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:07,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:07,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:07,746 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:07,826 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:07,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-09 21:45:07,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:45:07,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:45:07,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:45:07,827 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 13 states. [2018-04-09 21:45:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:08,197 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-04-09 21:45:08,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:45:08,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-09 21:45:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:08,199 INFO L225 Difference]: With dead ends: 143 [2018-04-09 21:45:08,199 INFO L226 Difference]: Without dead ends: 142 [2018-04-09 21:45:08,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:45:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-09 21:45:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2018-04-09 21:45:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-09 21:45:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-04-09 21:45:08,211 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 28 [2018-04-09 21:45:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:08,211 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-04-09 21:45:08,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:45:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-04-09 21:45:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 21:45:08,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:08,213 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] [2018-04-09 21:45:08,213 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash -718741057, 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:45:08,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:08,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:08,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:08,308 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:08,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-09 21:45:08,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:45:08,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:45:08,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:45:08,309 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 9 states. [2018-04-09 21:45:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:08,498 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-04-09 21:45:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:45:08,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-09 21:45:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:08,499 INFO L225 Difference]: With dead ends: 180 [2018-04-09 21:45:08,499 INFO L226 Difference]: Without dead ends: 135 [2018-04-09 21:45:08,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:45:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-09 21:45:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2018-04-09 21:45:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-09 21:45:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-04-09 21:45:08,511 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 34 [2018-04-09 21:45:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:08,511 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-04-09 21:45:08,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:45:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-04-09 21:45:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:45:08,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:08,513 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] [2018-04-09 21:45:08,513 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1454719071, 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:45:08,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:08,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:08,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:45:08,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-09 21:45:08,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:08,608 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 19 [2018-04-09 21:45:08,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:08,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:08,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:45:08,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,644 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:45:08,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 21:45:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:08,727 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:08,843 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 10 treesize of output 3 [2018-04-09 21:45:08,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-09 21:45:08,860 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 8 treesize of output 1 [2018-04-09 21:45:08,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:08,864 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:45:08,865 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-09 21:45:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:08,931 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:08,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 16 [2018-04-09 21:45:08,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:45:08,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:45:08,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:45:08,932 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 17 states. [2018-04-09 21:45:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:09,801 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-04-09 21:45:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 21:45:09,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-04-09 21:45:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:09,803 INFO L225 Difference]: With dead ends: 185 [2018-04-09 21:45:09,803 INFO L226 Difference]: Without dead ends: 144 [2018-04-09 21:45:09,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 21:45:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-09 21:45:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2018-04-09 21:45:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-09 21:45:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-04-09 21:45:09,815 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 35 [2018-04-09 21:45:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:09,815 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-04-09 21:45:09,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:45:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-04-09 21:45:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 21:45:09,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:09,817 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:09,817 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 24206100, 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:45:09,830 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:09,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:09,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:09,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:09,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:09,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:09,935 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:10,043 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:10,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-09 21:45:10,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:45:10,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:45:10,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:45:10,044 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 13 states. [2018-04-09 21:45:10,335 WARN L148 SmtUtils]: Spent 234ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 21:45:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:10,513 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-04-09 21:45:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:45:10,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-09 21:45:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:10,514 INFO L225 Difference]: With dead ends: 138 [2018-04-09 21:45:10,514 INFO L226 Difference]: Without dead ends: 136 [2018-04-09 21:45:10,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:45:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-09 21:45:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-04-09 21:45:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-09 21:45:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-04-09 21:45:10,522 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 39 [2018-04-09 21:45:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:10,522 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-04-09 21:45:10,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:45:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-04-09 21:45:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 21:45:10,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:10,524 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:10,524 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:10,524 INFO L82 PathProgramCache]: Analyzing trace with hash 750389122, 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:45:10,541 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:10,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:10,597 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:10,651 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:10,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-09 21:45:10,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:45:10,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:45:10,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:45:10,651 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 5 states. [2018-04-09 21:45:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:10,710 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-04-09 21:45:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:45:10,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-04-09 21:45:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:10,712 INFO L225 Difference]: With dead ends: 136 [2018-04-09 21:45:10,712 INFO L226 Difference]: Without dead ends: 135 [2018-04-09 21:45:10,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:45:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-09 21:45:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2018-04-09 21:45:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-09 21:45:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-04-09 21:45:10,721 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 40 [2018-04-09 21:45:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:10,722 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-04-09 21:45:10,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:45:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-04-09 21:45:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 21:45:10,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:10,723 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:10,723 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -981449705, 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:45:10,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:10,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:10,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:10,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:10,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:10,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:10,806 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:45:10,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:10,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:10,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-09 21:45:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:10,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:11,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-09 21:45:11,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:45:11,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:11,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:11,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:11,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-09 21:45:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:11,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:11,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-09 21:45:11,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:45:11,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:45:11,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=217, Unknown=2, NotChecked=0, Total=272 [2018-04-09 21:45:11,593 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 17 states. [2018-04-09 21:45:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:11,944 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-04-09 21:45:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:45:11,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-09 21:45:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:11,945 INFO L225 Difference]: With dead ends: 188 [2018-04-09 21:45:11,945 INFO L226 Difference]: Without dead ends: 147 [2018-04-09 21:45:11,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=505, Unknown=2, NotChecked=0, Total=650 [2018-04-09 21:45:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-09 21:45:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2018-04-09 21:45:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-09 21:45:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-04-09 21:45:11,955 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 41 [2018-04-09 21:45:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:11,955 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-04-09 21:45:11,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:45:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-04-09 21:45:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:45:11,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:11,956 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:11,956 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1672473413, 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:45:11,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:11,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:12,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:45:12,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:45:12,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,014 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:45:12,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-09 21:45:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:12,019 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:12,024 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 14 [2018-04-09 21:45:12,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2018-04-09 21:45:12,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:12,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-04-09 21:45:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:12,055 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:12,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-09 21:45:12,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:45:12,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:45:12,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:45:12,056 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 6 states. [2018-04-09 21:45:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:12,122 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-04-09 21:45:12,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:45:12,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-04-09 21:45:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:12,123 INFO L225 Difference]: With dead ends: 144 [2018-04-09 21:45:12,123 INFO L226 Difference]: Without dead ends: 131 [2018-04-09 21:45:12,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:45:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-09 21:45:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2018-04-09 21:45:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-09 21:45:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-04-09 21:45:12,130 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 47 [2018-04-09 21:45:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:12,130 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-04-09 21:45:12,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:45:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-04-09 21:45:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:45:12,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:12,131 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:12,131 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1050810381, now seen corresponding path program 2 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:45:12,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:12,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:12,266 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:12,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:12,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-09 21:45:12,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:45:12,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:45:12,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:45:12,349 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 15 states. [2018-04-09 21:45:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:12,577 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-04-09 21:45:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:45:12,578 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-04-09 21:45:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:12,579 INFO L225 Difference]: With dead ends: 255 [2018-04-09 21:45:12,579 INFO L226 Difference]: Without dead ends: 208 [2018-04-09 21:45:12,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:45:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-09 21:45:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2018-04-09 21:45:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-09 21:45:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-04-09 21:45:12,593 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 47 [2018-04-09 21:45:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:12,593 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-04-09 21:45:12,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:45:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-04-09 21:45:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-09 21:45:12,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:12,594 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:12,594 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1723209179, 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:45:12,604 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:12,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:12,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:12,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:45:12,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:12,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:12,652 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:45:12,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:45:12,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:12,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 21:45:12,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:12,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:45:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:12,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:12,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:45:12,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:12,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:45:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:12,743 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:12,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-09 21:45:12,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 21:45:12,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 21:45:12,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-09 21:45:12,744 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 12 states. [2018-04-09 21:45:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:12,935 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-04-09 21:45:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:45:12,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-09 21:45:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:12,937 INFO L225 Difference]: With dead ends: 169 [2018-04-09 21:45:12,937 INFO L226 Difference]: Without dead ends: 167 [2018-04-09 21:45:12,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:45:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-09 21:45:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-04-09 21:45:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-09 21:45:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2018-04-09 21:45:12,952 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 48 [2018-04-09 21:45:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:12,953 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2018-04-09 21:45:12,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 21:45:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2018-04-09 21:45:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:45:12,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:12,954 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:12,954 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1326143899, 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:45:12,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:12,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:13,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:13,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:13,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:13,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:13,232 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:13,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2018-04-09 21:45:13,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:45:13,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:45:13,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:45:13,233 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 17 states. [2018-04-09 21:45:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:13,614 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-04-09 21:45:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:45:13,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-09 21:45:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:13,615 INFO L225 Difference]: With dead ends: 176 [2018-04-09 21:45:13,615 INFO L226 Difference]: Without dead ends: 173 [2018-04-09 21:45:13,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-04-09 21:45:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-09 21:45:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-04-09 21:45:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-09 21:45:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-04-09 21:45:13,627 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 50 [2018-04-09 21:45:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:13,627 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-04-09 21:45:13,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:45:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-04-09 21:45:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 21:45:13,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:13,628 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:13,628 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1619579565, 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:45:13,635 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:13,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:13,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:13,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 21:45:13,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 21:45:13,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:13,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:13,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:13,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-09 21:45:13,761 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= (store (store .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |c_#valid|) (= 0 (select .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0)))) is different from true [2018-04-09 21:45:13,768 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__b~0.base Int) (~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= 0 (select .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0) (= (store (store (store .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 0) |c_#valid|)))) is different from true [2018-04-09 21:45:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:13,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:13,838 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_18| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc5.base_18| 1) c_~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |v_main_#t~malloc5.base_18| 0)) (not (= (select |c_#valid| |v_main_#t~malloc5.base_18|) 0)))) is different from false [2018-04-09 21:45:13,842 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_18| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store |c_#valid| |v_main_#t~malloc5.base_18| 1) |c_main_#t~malloc4.base| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|))) is different from false [2018-04-09 21:45:13,851 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_17| Int) (|v_main_#t~malloc5.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_17| 1))) (or (not (= (select .cse0 |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_18| 1) |v_main_#t~malloc4.base_17| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc4.base_17|) 0))))) is different from false [2018-04-09 21:45:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:45:13,883 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:45:13,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-09 21:45:13,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 21:45:13,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 21:45:13,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-09 21:45:13,885 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 18 states. [2018-04-09 21:45:13,911 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc4.base_17| Int) (|v_main_#t~malloc5.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_17| 1))) (or (not (= (select .cse0 |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_18| 1) |v_main_#t~malloc4.base_17| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc4.base_17|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:45:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:14,240 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2018-04-09 21:45:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:45:14,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-04-09 21:45:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:14,241 INFO L225 Difference]: With dead ends: 169 [2018-04-09 21:45:14,241 INFO L226 Difference]: Without dead ends: 130 [2018-04-09 21:45:14,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=284, Unknown=7, NotChecked=234, Total=600 [2018-04-09 21:45:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-09 21:45:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-04-09 21:45:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-09 21:45:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-09 21:45:14,254 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 51 [2018-04-09 21:45:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:14,254 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-09 21:45:14,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 21:45:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-09 21:45:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:45:14,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:14,255 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:14,255 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:14,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1595360437, now seen corresponding path program 3 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:45:14,264 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:14,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:14,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:14,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 21:45:14,339 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:45:14,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:14,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-09 21:45:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:14,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:14,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-09 21:45:14,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:45:14,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:14,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-09 21:45:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:14,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:14,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-09 21:45:14,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 21:45:14,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 21:45:14,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=426, Unknown=1, NotChecked=0, Total=506 [2018-04-09 21:45:14,881 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2018-04-09 21:45:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:15,527 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2018-04-09 21:45:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 21:45:15,528 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-09 21:45:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:15,528 INFO L225 Difference]: With dead ends: 206 [2018-04-09 21:45:15,528 INFO L226 Difference]: Without dead ends: 168 [2018-04-09 21:45:15,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1085, Unknown=1, NotChecked=0, Total=1332 [2018-04-09 21:45:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-09 21:45:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2018-04-09 21:45:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-09 21:45:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-04-09 21:45:15,538 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 54 [2018-04-09 21:45:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:15,539 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-04-09 21:45:15,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 21:45:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-04-09 21:45:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 21:45:15,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:15,539 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:15,539 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash 657403739, 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:45:15,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:15,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:15,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:15,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:15,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-04-09 21:45:15,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:45:15,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:45:15,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:45:15,677 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 11 states. [2018-04-09 21:45:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:15,806 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2018-04-09 21:45:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:45:15,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-04-09 21:45:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:15,844 INFO L225 Difference]: With dead ends: 195 [2018-04-09 21:45:15,844 INFO L226 Difference]: Without dead ends: 162 [2018-04-09 21:45:15,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:45:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-09 21:45:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-04-09 21:45:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-09 21:45:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-04-09 21:45:15,853 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 56 [2018-04-09 21:45:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:15,853 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-04-09 21:45:15,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:45:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-04-09 21:45:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 21:45:15,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:15,854 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:15,854 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -337570150, 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:45:15,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:15,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:15,937 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:15,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 21 [2018-04-09 21:45:15,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:15,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:45:15,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-04-09 21:45:16,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-09 21:45:16,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:16,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 25 [2018-04-09 21:45:16,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:16,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:16,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-09 21:45:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 21:45:16,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:16,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-04-09 21:45:16,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:45:16,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:45:16,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:45:16,281 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 15 states. [2018-04-09 21:45:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:16,698 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-04-09 21:45:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:45:16,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-04-09 21:45:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:16,699 INFO L225 Difference]: With dead ends: 164 [2018-04-09 21:45:16,699 INFO L226 Difference]: Without dead ends: 163 [2018-04-09 21:45:16,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:45:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-09 21:45:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2018-04-09 21:45:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-09 21:45:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-04-09 21:45:16,711 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 59 [2018-04-09 21:45:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:16,712 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-04-09 21:45:16,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:45:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-04-09 21:45:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:45:16,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:16,713 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:16,713 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1324242389, now seen corresponding path program 4 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:45:16,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:16,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:16,802 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:16,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:16,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-04-09 21:45:16,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:45:16,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:45:16,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:45:16,891 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-04-09 21:45:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:45:17,444 INFO L93 Difference]: Finished difference Result 283 states and 292 transitions. [2018-04-09 21:45:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-09 21:45:17,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-09 21:45:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:45:17,446 INFO L225 Difference]: With dead ends: 283 [2018-04-09 21:45:17,446 INFO L226 Difference]: Without dead ends: 239 [2018-04-09 21:45:17,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 21:45:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-09 21:45:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 188. [2018-04-09 21:45:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-09 21:45:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2018-04-09 21:45:17,469 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 60 [2018-04-09 21:45:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:45:17,469 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2018-04-09 21:45:17,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:45:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2018-04-09 21:45:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:45:17,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:45:17,471 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:45:17,471 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:45:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1039770973, 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:45:17,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:45:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:45:17,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:45:17,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:17,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:45:17,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:17,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:17,561 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:45:17,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 21:45:17,614 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:45:17,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:17,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 21:45:17,641 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 7 treesize of output 5 [2018-04-09 21:45:17,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:45:17,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-09 21:45:17,849 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 38 treesize of output 42 [2018-04-09 21:45:17,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-09 21:45:17,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-09 21:45:17,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-09 21:45:17,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:17,891 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 19 [2018-04-09 21:45:17,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:17,913 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:45:17,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 21:45:17,923 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2018-04-09 21:45:20,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-09 21:45:20,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:20,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:20,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:20,061 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 23 treesize of output 22 [2018-04-09 21:45:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:20,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-04-09 21:45:20,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:20,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:20,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:20,083 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:60, output treesize:10 [2018-04-09 21:45:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:20,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:45:26,757 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-09 21:45:33,611 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 94 treesize of output 72 [2018-04-09 21:45:33,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:33,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:33,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 99 [2018-04-09 21:45:33,965 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 167 DAG size of output 157 [2018-04-09 21:45:33,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 67 treesize of output 63 [2018-04-09 21:45:33,977 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 45 treesize of output 47 [2018-04-09 21:45:33,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:45:33,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-09 21:45:34,006 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:34,007 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:45:34,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 114 [2018-04-09 21:45:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 145 [2018-04-09 21:45:34,372 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 240 DAG size of output 120 [2018-04-09 21:45:34,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:34,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,376 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-04-09 21:45:34,377 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,496 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 55 treesize of output 52 [2018-04-09 21:45:34,496 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 88 [2018-04-09 21:45:34,606 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:34,611 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,611 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2018-04-09 21:45:34,625 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:34,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:34,794 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-04-09 21:45:34,795 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:34,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:34,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-09 21:45:34,882 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:34,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 93 [2018-04-09 21:45:34,946 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:34,987 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,080 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 77 [2018-04-09 21:45:35,332 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-04-09 21:45:35,334 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,553 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 74 treesize of output 70 [2018-04-09 21:45:35,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 47 [2018-04-09 21:45:35,570 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:45:35,570 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-09 21:45:35,575 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-09 21:45:35,600 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,611 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,620 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45:35,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:45:35,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-09 21:45:35,685 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:45:35,686 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:35,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-09 21:45:35,711 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,712 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:45:35,712 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:35,741 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,760 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:35,989 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 61 treesize of output 57 [2018-04-09 21:45:35,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:45:36,006 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:45:36,006 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-09 21:45:36,011 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-09 21:45:36,032 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:36,042 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,047 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 131 [2018-04-09 21:45:36,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-04-09 21:45:36,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-04-09 21:45:36,136 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,144 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 148 [2018-04-09 21:45:36,738 WARN L151 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 249 DAG size of output 137 [2018-04-09 21:45:36,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:36,744 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2018-04-09 21:45:36,746 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:36,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 118 [2018-04-09 21:45:36,889 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:36,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:36,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 98 [2018-04-09 21:45:36,904 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:37,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 61 [2018-04-09 21:45:37,007 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-04-09 21:45:37,064 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,140 INFO L267 ElimStorePlain]: Start of recursive call 39: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:37,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-09 21:45:37,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-04-09 21:45:37,243 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,248 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-09 21:45:37,413 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:37,415 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:45:37,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:45:37,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-04-09 21:45:37,417 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,424 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:45:37,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-09 21:45:37,558 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:37,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-09 21:45:37,593 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:45:37,594 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:37,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-09 21:45:37,598 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,626 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:37,674 INFO L267 ElimStorePlain]: Start of recursive call 36: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:37,816 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 96 [2018-04-09 21:45:37,817 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:37,949 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-09 21:45:37,952 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 45 treesize of output 41 [2018-04-09 21:45:37,963 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:45:37,963 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:37,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-09 21:45:37,977 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-09 21:45:38,001 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,020 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,035 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 60 treesize of output 56 [2018-04-09 21:45:38,041 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 45 treesize of output 41 [2018-04-09 21:45:38,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:45:38,054 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-09 21:45:38,069 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-09 21:45:38,093 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,116 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,137 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-09 21:45:38,218 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 58 treesize of output 54 [2018-04-09 21:45:38,288 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 45 treesize of output 41 [2018-04-09 21:45:38,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:45:38,301 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-09 21:45:38,329 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-09 21:45:38,346 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,369 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,389 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-04-09 21:45:38,519 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-04-09 21:45:38,521 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:45:38,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-04-09 21:45:38,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-09 21:45:38,717 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-09 21:45:38,718 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-09 21:45:38,720 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,755 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2018-04-09 21:45:38,756 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,757 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 23 treesize of output 18 [2018-04-09 21:45:38,758 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-09 21:45:38,778 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,792 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2018-04-09 21:45:38,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 62 treesize of output 58 [2018-04-09 21:45:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-09 21:45:38,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-09 21:45:38,830 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:45:38,833 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:38,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-09 21:45:38,858 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,885 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:38,906 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,938 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 59 treesize of output 55 [2018-04-09 21:45:38,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:45:38,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-09 21:45:38,984 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-09 21:45:38,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-09 21:45:38,989 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:39,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-09 21:45:39,024 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:45:39,024 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 3 xjuncts. [2018-04-09 21:45:39,054 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:45:39,075 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:45:39,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-09 21:45:39,117 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-09 21:45:39,119 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-09 21:45:39,155 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:45:39,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:45:39,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:45:39,259 INFO L202 ElimStorePlain]: Needed 91 recursive calls to eliminate 4 variables, input treesize:98, output treesize:146 [2018-04-09 21:45:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:45:40,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:45:40,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-09 21:45:40,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-09 21:45:40,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-09 21:45:40,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1133, Unknown=29, NotChecked=0, Total=1406 [2018-04-09 21:45:40,201 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand 38 states. [2018-04-09 21:45:52,422 WARN L151 SmtUtils]: Spent 4049ms on a formula simplification. DAG size of input: 69 DAG size of output 50 [2018-04-09 21:46:23,069 WARN L148 SmtUtils]: Spent 22129ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-09 21:46:35,674 WARN L151 SmtUtils]: Spent 4265ms on a formula simplification. DAG size of input: 65 DAG size of output 46 [2018-04-09 21:46:59,282 WARN L148 SmtUtils]: Spent 22803ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-09 21:47:13,598 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 46 DAG size of output 37 [2018-04-09 21:47:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:26,597 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2018-04-09 21:47:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 21:47:26,613 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-04-09 21:47:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:26,614 INFO L225 Difference]: With dead ends: 212 [2018-04-09 21:47:26,614 INFO L226 Difference]: Without dead ends: 200 [2018-04-09 21:47:26,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 97.3s TimeCoverageRelationStatistics Valid=874, Invalid=3338, Unknown=78, NotChecked=0, Total=4290 [2018-04-09 21:47:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-09 21:47:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2018-04-09 21:47:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-09 21:47:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2018-04-09 21:47:26,635 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 66 [2018-04-09 21:47:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:26,636 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2018-04-09 21:47:26,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-09 21:47:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2018-04-09 21:47:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-09 21:47:26,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:26,637 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:47:26,637 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash 250629763, now seen corresponding path program 5 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:47:26,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:26,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:26,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:47:26,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:26,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:26,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 21:47:26,708 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:47:26,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:26,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:47:26,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-09 21:47:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:26,863 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:27,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-09 21:47:27,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:47:27,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:27,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:27,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:27,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-09 21:47:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:27,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:27,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-04-09 21:47:27,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-09 21:47:27,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-09 21:47:27,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=702, Unknown=1, NotChecked=0, Total=812 [2018-04-09 21:47:27,365 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand 29 states. [2018-04-09 21:47:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:28,490 INFO L93 Difference]: Finished difference Result 276 states and 283 transitions. [2018-04-09 21:47:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 21:47:28,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-09 21:47:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:28,492 INFO L225 Difference]: With dead ends: 276 [2018-04-09 21:47:28,492 INFO L226 Difference]: Without dead ends: 238 [2018-04-09 21:47:28,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=1962, Unknown=1, NotChecked=0, Total=2352 [2018-04-09 21:47:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-09 21:47:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2018-04-09 21:47:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-09 21:47:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-04-09 21:47:28,507 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 67 [2018-04-09 21:47:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:28,507 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-04-09 21:47:28,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-09 21:47:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-04-09 21:47:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-09 21:47:28,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:28,508 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:47:28,508 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2067849475, now seen corresponding path program 2 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:47:28,514 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:28,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:28,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:28,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:28,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:47:28,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:47:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:28,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:28,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:28,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-09 21:47:28,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 21:47:28,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 21:47:28,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:47:28,919 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 23 states. [2018-04-09 21:47:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:29,541 INFO L93 Difference]: Finished difference Result 251 states and 260 transitions. [2018-04-09 21:47:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 21:47:29,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-09 21:47:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:29,543 INFO L225 Difference]: With dead ends: 251 [2018-04-09 21:47:29,543 INFO L226 Difference]: Without dead ends: 222 [2018-04-09 21:47:29,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 21:47:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-09 21:47:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 207. [2018-04-09 21:47:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-09 21:47:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 214 transitions. [2018-04-09 21:47:29,561 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 214 transitions. Word has length 69 [2018-04-09 21:47:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:29,561 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 214 transitions. [2018-04-09 21:47:29,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 21:47:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-04-09 21:47:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-09 21:47:29,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:29,561 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:47:29,562 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1806048107, 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:47:29,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:29,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:29,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:29,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 21:47:29,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 21:47:29,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:29,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:29,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:29,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-09 21:47:29,664 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= (store (store .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |c_#valid|) (= 0 (select .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0)))) is different from true [2018-04-09 21:47:29,668 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__b~0.base Int) (~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= 0 (select .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0) (= (store (store (store .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 0) |c_#valid|)))) is different from true [2018-04-09 21:47:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-09 21:47:29,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:29,715 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc5.base_26| 1) c_~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |v_main_#t~malloc5.base_26| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_26|))))) is different from false [2018-04-09 21:47:29,717 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc5.base_26| 1) |c_main_#t~malloc4.base| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|))) is different from false [2018-04-09 21:47:29,719 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int) (|v_main_#t~malloc4.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_25|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_26| 1) |v_main_#t~malloc4.base_25| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_26|)))))) is different from false [2018-04-09 21:47:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-09 21:47:29,777 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:47:29,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-09 21:47:29,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 21:47:29,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 21:47:29,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-09 21:47:29,778 INFO L87 Difference]: Start difference. First operand 207 states and 214 transitions. Second operand 18 states. [2018-04-09 21:47:29,804 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc5.base_26| Int) (|v_main_#t~malloc4.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_25|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_26| 1) |v_main_#t~malloc4.base_25| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_26|))))))) is different from false [2018-04-09 21:47:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:30,098 INFO L93 Difference]: Finished difference Result 209 states and 216 transitions. [2018-04-09 21:47:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:47:30,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-04-09 21:47:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:30,099 INFO L225 Difference]: With dead ends: 209 [2018-04-09 21:47:30,100 INFO L226 Difference]: Without dead ends: 154 [2018-04-09 21:47:30,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=344, Unknown=10, NotChecked=258, Total=702 [2018-04-09 21:47:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-09 21:47:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-09 21:47:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-09 21:47:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-04-09 21:47:30,114 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 70 [2018-04-09 21:47:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:30,114 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-04-09 21:47:30,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 21:47:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-04-09 21:47:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 21:47:30,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:30,114 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:47:30,114 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 58958201, now seen corresponding path program 6 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:47:30,124 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:30,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:30,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:30,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:30,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-04-09 21:47:30,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-09 21:47:30,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-09 21:47:30,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-04-09 21:47:30,359 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 27 states. [2018-04-09 21:47:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:30,851 INFO L93 Difference]: Finished difference Result 281 states and 287 transitions. [2018-04-09 21:47:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-09 21:47:30,852 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 73 [2018-04-09 21:47:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:30,853 INFO L225 Difference]: With dead ends: 281 [2018-04-09 21:47:30,853 INFO L226 Difference]: Without dead ends: 244 [2018-04-09 21:47:30,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=538, Invalid=2218, Unknown=0, NotChecked=0, Total=2756 [2018-04-09 21:47:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-09 21:47:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2018-04-09 21:47:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-09 21:47:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 225 transitions. [2018-04-09 21:47:30,870 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 225 transitions. Word has length 73 [2018-04-09 21:47:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:30,870 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 225 transitions. [2018-04-09 21:47:30,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-09 21:47:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 225 transitions. [2018-04-09 21:47:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-09 21:47:30,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:30,871 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:47:30,871 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -806169101, now seen corresponding path program 3 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:47:30,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:30,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:30,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:31,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:31,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-04-09 21:47:31,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:47:31,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:47:31,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:47:31,058 INFO L87 Difference]: Start difference. First operand 217 states and 225 transitions. Second operand 17 states. [2018-04-09 21:47:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:31,343 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2018-04-09 21:47:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 21:47:31,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-04-09 21:47:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:31,344 INFO L225 Difference]: With dead ends: 247 [2018-04-09 21:47:31,344 INFO L226 Difference]: Without dead ends: 227 [2018-04-09 21:47:31,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:47:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-09 21:47:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2018-04-09 21:47:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-09 21:47:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 222 transitions. [2018-04-09 21:47:31,361 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 222 transitions. Word has length 75 [2018-04-09 21:47:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:31,361 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 222 transitions. [2018-04-09 21:47:31,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:47:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 222 transitions. [2018-04-09 21:47:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-09 21:47:31,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:31,362 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:47:31,362 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash 871942402, now seen corresponding path program 2 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:47:31,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:31,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:31,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:31,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 20 [2018-04-09 21:47:31,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:31,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:47:31,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-04-09 21:47:31,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 25 [2018-04-09 21:47:31,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:31,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:47:31,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:31,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:47:31,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-09 21:47:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-09 21:47:31,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:31,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-09 21:47:31,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 21:47:31,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 21:47:31,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:47:31,784 INFO L87 Difference]: Start difference. First operand 216 states and 222 transitions. Second operand 23 states. [2018-04-09 21:47:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:32,430 INFO L93 Difference]: Finished difference Result 227 states and 232 transitions. [2018-04-09 21:47:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 21:47:32,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-04-09 21:47:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:32,431 INFO L225 Difference]: With dead ends: 227 [2018-04-09 21:47:32,431 INFO L226 Difference]: Without dead ends: 226 [2018-04-09 21:47:32,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 21:47:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-09 21:47:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-04-09 21:47:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-09 21:47:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2018-04-09 21:47:32,449 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 78 [2018-04-09 21:47:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:32,449 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2018-04-09 21:47:32,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 21:47:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2018-04-09 21:47:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-09 21:47:32,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:32,450 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:47:32,450 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:32,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1473039393, now seen corresponding path program 7 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:47:32,456 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:32,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:32,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:47:32,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:32,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:32,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 21:47:32,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:47:32,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:32,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:47:32,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-09 21:47:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:32,789 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:33,808 WARN L148 SmtUtils]: Spent 291ms on a formula simplification that was a NOOP. DAG size: 18 [2018-04-09 21:47:33,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-09 21:47:33,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:47:33,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:33,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:33,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:33,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-09 21:47:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:33,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:47:33,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-04-09 21:47:33,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 21:47:33,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 21:47:33,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1046, Unknown=1, NotChecked=0, Total=1190 [2018-04-09 21:47:33,921 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand 35 states. [2018-04-09 21:47:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:47:35,265 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2018-04-09 21:47:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-09 21:47:35,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-04-09 21:47:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:47:35,267 INFO L225 Difference]: With dead ends: 280 [2018-04-09 21:47:35,267 INFO L226 Difference]: Without dead ends: 249 [2018-04-09 21:47:35,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=542, Invalid=2997, Unknown=1, NotChecked=0, Total=3540 [2018-04-09 21:47:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-09 21:47:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 224. [2018-04-09 21:47:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-09 21:47:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-04-09 21:47:35,293 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 80 [2018-04-09 21:47:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:47:35,293 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-04-09 21:47:35,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 21:47:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-04-09 21:47:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-09 21:47:35,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:47:35,294 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:47:35,294 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:47:35,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1186767675, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:47:35,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:47:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:47:35,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:47:35,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:47:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:47:35,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:35,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:35,364 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:47:35,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 21:47:35,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:47:35,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:35,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 21:47:35,433 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 7 treesize of output 5 [2018-04-09 21:47:35,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:47:35,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-09 21:47:35,843 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 50 treesize of output 54 [2018-04-09 21:47:35,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-09 21:47:35,849 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 29 treesize of output 38 [2018-04-09 21:47:35,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-04-09 21:47:35,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,883 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 57 treesize of output 56 [2018-04-09 21:47:35,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:35,886 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 19 treesize of output 25 [2018-04-09 21:47:35,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:35,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:35,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-04-09 21:47:35,891 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,909 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:35,919 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:47:35,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-09 21:47:35,932 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:86, output treesize:67 [2018-04-09 21:47:38,045 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 75 treesize of output 63 [2018-04-09 21:47:38,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:38,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:38,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:38,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:47:38,049 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:47:38,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-04-09 21:47:38,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:38,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-04-09 21:47:38,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:38,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:38,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:47:38,073 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:82, output treesize:10 [2018-04-09 21:47:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:47:38,116 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:47:59,434 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 118 treesize of output 96 [2018-04-09 21:47:59,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:59,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:59,468 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 89 treesize of output 91 [2018-04-09 21:47:59,472 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 83 treesize of output 79 [2018-04-09 21:47:59,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-04-09 21:47:59,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-09 21:47:59,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-09 21:47:59,514 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:47:59,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-09 21:47:59,569 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-09 21:47:59,570 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-09 21:47:59,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-09 21:47:59,615 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-09 21:47:59,628 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:59,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,699 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,722 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2018-04-09 21:47:59,783 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:59,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-04-09 21:47:59,818 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 69 treesize of output 65 [2018-04-09 21:47:59,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-09 21:47:59,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 61 [2018-04-09 21:47:59,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-09 21:47:59,873 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-09 21:47:59,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-09 21:47:59,881 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:47:59,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:47:59,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-09 21:47:59,925 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:47:59,927 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-04-09 21:47:59,965 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:47:59,986 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,003 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,023 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:48:00,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 133 [2018-04-09 21:48:00,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 114 [2018-04-09 21:48:00,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:00,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-09 21:48:00,140 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:00,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-09 21:48:00,143 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:00,158 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 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-09 21:48:00,158 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-04-09 21:48:00,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-09 21:48:00,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-09 21:48:00,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-09 21:48:00,262 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,265 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:00,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-09 21:48:00,325 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-09 21:48:00,326 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:00,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-09 21:48:00,337 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:00,372 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,392 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,412 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,434 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 118 treesize of output 114 [2018-04-09 21:48:00,554 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 69 treesize of output 71 [2018-04-09 21:48:00,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-09 21:48:00,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 67 [2018-04-09 21:48:00,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-09 21:48:00,614 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:00,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-09 21:48:00,668 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:48:00,669 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:00,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-09 21:48:00,677 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:00,714 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,732 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,749 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,773 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:00,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-04-09 21:48:00,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 77 [2018-04-09 21:48:00,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-04-09 21:48:00,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2018-04-09 21:48:00,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-09 21:48:01,037 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-09 21:48:01,038 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:01,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-09 21:48:01,075 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-09 21:48:01,099 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:01,136 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,155 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,189 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-09 21:48:01,219 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:01,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-09 21:48:01,238 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:01,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-09 21:48:01,252 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,281 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,393 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 115 treesize of output 115 [2018-04-09 21:48:01,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-09 21:48:01,413 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:01,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-09 21:48:01,434 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:01,446 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 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-09 21:48:01,447 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,477 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-04-09 21:48:01,574 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 69 treesize of output 65 [2018-04-09 21:48:01,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-09 21:48:01,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-09 21:48:01,603 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 108 [2018-04-09 21:48:01,625 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,626 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:48:01,626 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:01,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:01,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 125 [2018-04-09 21:48:01,671 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:48:01,672 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:01,701 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,715 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,729 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,749 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:01,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-04-09 21:48:01,832 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:01,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-09 21:48:01,991 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-09 21:48:02,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:48:02,165 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:02,172 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-09 21:48:02,172 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-09 21:48:02,174 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,189 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105 [2018-04-09 21:48:02,440 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 69 treesize of output 71 [2018-04-09 21:48:02,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-09 21:48:02,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 67 [2018-04-09 21:48:02,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:02,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-09 21:48:02,514 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:48:02,515 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:02,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-09 21:48:02,523 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-09 21:48:02,553 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,588 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,604 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,619 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,647 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:02,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-09 21:48:02,653 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,654 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 20 treesize of output 15 [2018-04-09 21:48:02,654 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,660 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:48:02,660 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,686 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,749 INFO L267 ElimStorePlain]: Start of recursive call 20: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:48:02,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-04-09 21:48:02,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-09 21:48:02,757 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-04-09 21:48:02,780 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:02,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-09 21:48:02,786 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,787 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 20 treesize of output 15 [2018-04-09 21:48:02,787 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,792 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:48:02,792 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,801 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,813 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 40 treesize of output 40 [2018-04-09 21:48:02,834 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 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-09 21:48:02,835 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-09 21:48:02,837 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:02,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:02,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, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-09 21:48:02,854 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-09 21:48:02,878 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:02,891 INFO L267 ElimStorePlain]: Start of recursive call 75: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:48:02,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:48:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:48:03,022 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 5 variables, input treesize:122, output treesize:174 [2018-04-09 21:48:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 10 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:48:03,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:03,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2018-04-09 21:48:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-09 21:48:03,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-09 21:48:03,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1961, Unknown=55, NotChecked=0, Total=2352 [2018-04-09 21:48:03,486 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 49 states. [2018-04-09 21:48:18,622 WARN L151 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 76 DAG size of output 53 [2018-04-09 21:48:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:37,626 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-04-09 21:48:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-09 21:48:37,627 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 85 [2018-04-09 21:48:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:37,628 INFO L225 Difference]: With dead ends: 232 [2018-04-09 21:48:37,628 INFO L226 Difference]: Without dead ends: 173 [2018-04-09 21:48:37,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=1025, Invalid=4986, Unknown=151, NotChecked=0, Total=6162 [2018-04-09 21:48:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-09 21:48:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-09 21:48:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-09 21:48:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2018-04-09 21:48:37,642 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 85 [2018-04-09 21:48:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:37,643 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2018-04-09 21:48:37,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-09 21:48:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2018-04-09 21:48:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-09 21:48:37,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:37,643 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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:48:37,643 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1214705815, now seen corresponding path program 8 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:48:37,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:37,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:37,803 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:37,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:37,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-04-09 21:48:37,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-09 21:48:37,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-09 21:48:37,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 21:48:37,973 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand 33 states. [2018-04-09 21:48:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:38,599 INFO L93 Difference]: Finished difference Result 306 states and 312 transitions. [2018-04-09 21:48:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-09 21:48:38,599 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2018-04-09 21:48:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:38,600 INFO L225 Difference]: With dead ends: 306 [2018-04-09 21:48:38,600 INFO L226 Difference]: Without dead ends: 269 [2018-04-09 21:48:38,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=791, Invalid=3499, Unknown=0, NotChecked=0, Total=4290 [2018-04-09 21:48:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-09 21:48:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 242. [2018-04-09 21:48:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-09 21:48:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 250 transitions. [2018-04-09 21:48:38,633 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 250 transitions. Word has length 86 [2018-04-09 21:48:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:38,634 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 250 transitions. [2018-04-09 21:48:38,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-09 21:48:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 250 transitions. [2018-04-09 21:48:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-09 21:48:38,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:38,635 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:48:38,635 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1528456987, now seen corresponding path program 4 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:48:38,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:38,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:38,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:38,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:38,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:48:38,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 21:48:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:38,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:39,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:39,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-04-09 21:48:39,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-09 21:48:39,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-09 21:48:39,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:48:39,100 INFO L87 Difference]: Start difference. First operand 242 states and 250 transitions. Second operand 29 states. [2018-04-09 21:48:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:39,780 INFO L93 Difference]: Finished difference Result 284 states and 296 transitions. [2018-04-09 21:48:39,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 21:48:39,780 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-04-09 21:48:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:39,782 INFO L225 Difference]: With dead ends: 284 [2018-04-09 21:48:39,782 INFO L226 Difference]: Without dead ends: 266 [2018-04-09 21:48:39,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-04-09 21:48:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-09 21:48:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2018-04-09 21:48:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-09 21:48:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 268 transitions. [2018-04-09 21:48:39,807 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 268 transitions. Word has length 88 [2018-04-09 21:48:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:39,807 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 268 transitions. [2018-04-09 21:48:39,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-09 21:48:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 268 transitions. [2018-04-09 21:48:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-09 21:48:39,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:39,808 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:48:39,808 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1889642769, now seen corresponding path program 9 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:48:39,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:39,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:39,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:39,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:39,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:39,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 21:48:39,923 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:48:39,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:39,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:48:39,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-09 21:48:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 85 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:40,203 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:40,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-09 21:48:40,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:48:40,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:40,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:40,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:40,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-09 21:48:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 85 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:40,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:40,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 40 [2018-04-09 21:48:40,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-09 21:48:40,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-09 21:48:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1458, Unknown=1, NotChecked=0, Total=1640 [2018-04-09 21:48:40,874 INFO L87 Difference]: Start difference. First operand 260 states and 268 transitions. Second operand 41 states. [2018-04-09 21:48:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:42,322 INFO L93 Difference]: Finished difference Result 332 states and 337 transitions. [2018-04-09 21:48:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-09 21:48:42,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 93 [2018-04-09 21:48:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:42,323 INFO L225 Difference]: With dead ends: 332 [2018-04-09 21:48:42,323 INFO L226 Difference]: Without dead ends: 295 [2018-04-09 21:48:42,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 135 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=718, Invalid=4251, Unknown=1, NotChecked=0, Total=4970 [2018-04-09 21:48:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-09 21:48:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 266. [2018-04-09 21:48:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-09 21:48:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 274 transitions. [2018-04-09 21:48:42,347 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 274 transitions. Word has length 93 [2018-04-09 21:48:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:42,348 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 274 transitions. [2018-04-09 21:48:42,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-09 21:48:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 274 transitions. [2018-04-09 21:48:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-09 21:48:42,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:42,349 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:48:42,349 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2118140379, now seen corresponding path program 5 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:48:42,360 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:42,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:42,478 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:42,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:42,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-04-09 21:48:42,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 21:48:42,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 21:48:42,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:48:42,603 INFO L87 Difference]: Start difference. First operand 266 states and 274 transitions. Second operand 23 states. [2018-04-09 21:48:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:42,883 INFO L93 Difference]: Finished difference Result 296 states and 302 transitions. [2018-04-09 21:48:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 21:48:42,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-04-09 21:48:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:42,918 INFO L225 Difference]: With dead ends: 296 [2018-04-09 21:48:42,918 INFO L226 Difference]: Without dead ends: 276 [2018-04-09 21:48:42,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 21:48:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-09 21:48:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 265. [2018-04-09 21:48:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-09 21:48:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 271 transitions. [2018-04-09 21:48:42,946 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 271 transitions. Word has length 94 [2018-04-09 21:48:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:42,946 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 271 transitions. [2018-04-09 21:48:42,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 21:48:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 271 transitions. [2018-04-09 21:48:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-09 21:48:42,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:42,947 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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:48:42,947 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash -140970982, now seen corresponding path program 3 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:48:42,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:42,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:43,194 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:43,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 20 [2018-04-09 21:48:43,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:43,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:48:43,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-04-09 21:48:43,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-09 21:48:43,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:43,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:48:43,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:43,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:48:43,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-09 21:48:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-09 21:48:44,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:44,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-04-09 21:48:44,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 21:48:44,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 21:48:44,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2018-04-09 21:48:44,378 INFO L87 Difference]: Start difference. First operand 265 states and 271 transitions. Second operand 31 states. [2018-04-09 21:48:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:45,434 INFO L93 Difference]: Finished difference Result 276 states and 281 transitions. [2018-04-09 21:48:45,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 21:48:45,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-04-09 21:48:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:45,435 INFO L225 Difference]: With dead ends: 276 [2018-04-09 21:48:45,435 INFO L226 Difference]: Without dead ends: 275 [2018-04-09 21:48:45,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2018-04-09 21:48:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-09 21:48:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2018-04-09 21:48:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-09 21:48:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 273 transitions. [2018-04-09 21:48:45,474 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 273 transitions. Word has length 97 [2018-04-09 21:48:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:45,474 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 273 transitions. [2018-04-09 21:48:45,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 21:48:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 273 transitions. [2018-04-09 21:48:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-09 21:48:45,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:45,475 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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:48:45,475 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2087495909, now seen corresponding path program 10 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:48:45,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:45,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:45,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:45,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:48:45,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-04-09 21:48:45,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-09 21:48:45,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-09 21:48:45,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 21:48:45,968 INFO L87 Difference]: Start difference. First operand 267 states and 273 transitions. Second operand 39 states. [2018-04-09 21:48:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:48:47,207 INFO L93 Difference]: Finished difference Result 426 states and 432 transitions. [2018-04-09 21:48:47,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-09 21:48:47,208 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 99 [2018-04-09 21:48:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:48:47,209 INFO L225 Difference]: With dead ends: 426 [2018-04-09 21:48:47,209 INFO L226 Difference]: Without dead ends: 383 [2018-04-09 21:48:47,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 149 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1519, Invalid=7037, Unknown=0, NotChecked=0, Total=8556 [2018-04-09 21:48:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-09 21:48:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2018-04-09 21:48:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-09 21:48:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 357 transitions. [2018-04-09 21:48:47,246 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 357 transitions. Word has length 99 [2018-04-09 21:48:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:48:47,246 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 357 transitions. [2018-04-09 21:48:47,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-09 21:48:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 357 transitions. [2018-04-09 21:48:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-09 21:48:47,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:48:47,247 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,247 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-09 21:48:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1094562525, now seen corresponding path program 3 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:48:47,253 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:48:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:48:47,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:48:47,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:48:47,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:48:47,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:47,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:47,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:48:47,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 21:48:47,381 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:48:47,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:48:47,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 21:48:47,405 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 7 treesize of output 5 [2018-04-09 21:48:47,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:48:47,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:47,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-09 21:48:48,215 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 62 treesize of output 66 [2018-04-09 21:48:48,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 treesize of output 36 [2018-04-09 21:48:48,222 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 36 treesize of output 45 [2018-04-09 21:48:48,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-04-09 21:48:48,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-09 21:48:48,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,286 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 73 treesize of output 72 [2018-04-09 21:48:48,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-04-09 21:48:48,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,295 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 34 treesize of output 68 [2018-04-09 21:48:48,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:48,302 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 36 treesize of output 101 [2018-04-09 21:48:48,302 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,315 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,337 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:48,349 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:48:48,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-09 21:48:48,366 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:105, output treesize:95 [2018-04-09 21:48:50,523 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 103 treesize of output 85 [2018-04-09 21:48:50,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:48:50,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:48:50,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 109 [2018-04-09 21:48:50,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:50,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 7 [2018-04-09 21:48:50,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:48:50,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:50,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:48:50,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:110, output treesize:10 [2018-04-09 21:48:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 65 refuted. 33 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:48:50,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:48:50,931 WARN L148 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-09 21:48:51,617 WARN L148 SmtUtils]: Spent 262ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-09 21:48:58,994 WARN L148 SmtUtils]: Spent 320ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-09 21:49:23,096 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 142 treesize of output 120 [2018-04-09 21:49:23,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:49:23,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:23,135 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 113 treesize of output 115 [2018-04-09 21:49:23,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 110 treesize of output 106 [2018-04-09 21:49:23,141 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 93 treesize of output 95 [2018-04-09 21:49:23,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-04-09 21:49:23,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2018-04-09 21:49:23,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 87 [2018-04-09 21:49:23,175 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2018-04-09 21:49:23,210 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,211 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 188 [2018-04-09 21:49:23,278 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-09 21:49:23,279 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:23,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-04-09 21:49:23,296 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:23,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 166 [2018-04-09 21:49:23,346 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:49:23,347 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,396 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,422 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,446 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,470 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,569 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 107 treesize of output 103 [2018-04-09 21:49: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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-04-09 21:49:23,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2018-04-09 21:49:23,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2018-04-09 21:49:23,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2018-04-09 21:49:23,617 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-04-09 21:49:23,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 184 [2018-04-09 21:49:23,709 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:49:23,710 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,720 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-09 21:49:23,730 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:23,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,744 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:23,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 211 [2018-04-09 21:49:23,822 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-09 21:49:23,823 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:23,886 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:49:23,920 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,946 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:23,978 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,005 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,033 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-04-09 21:49:24,106 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-04-09 21:49:24,108 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:49:24,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2018-04-09 21:49:24,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-09 21:49:24,183 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-04-09 21:49:24,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,197 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 41 treesize of output 44 [2018-04-09 21:49:24,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,216 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 2 case distinctions, treesize of input 36 treesize of output 62 [2018-04-09 21:49:24,217 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,218 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-09 21:49:24,219 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,233 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 2 case distinctions, treesize of input 34 treesize of output 64 [2018-04-09 21:49:24,234 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,244 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,248 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,260 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 50 treesize of output 50 [2018-04-09 21:49:24,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-04-09 21:49:24,275 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-09 21:49:24,277 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,283 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 87 [2018-04-09 21:49:24,303 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:24,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 80 [2018-04-09 21:49:24,321 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,348 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:49:24,360 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,375 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:49:24,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 167 [2018-04-09 21:49:24,400 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 149 treesize of output 145 [2018-04-09 21:49:24,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-04-09 21:49:24,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2018-04-09 21:49:24,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2018-04-09 21:49:24,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2018-04-09 21:49:24,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-04-09 21:49:24,500 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 211 [2018-04-09 21:49:24,580 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-09 21:49:24,581 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:24,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-09 21:49:24,601 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:24,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:24,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 184 [2018-04-09 21:49:24,670 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:49:24,670 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,726 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,749 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,772 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,795 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,819 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:24,847 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 145 [2018-04-09 21:49:25,025 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 93 treesize of output 95 [2018-04-09 21:49:25,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-04-09 21:49:25,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2018-04-09 21:49:25,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 87 [2018-04-09 21:49:25,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2018-04-09 21:49:25,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-04-09 21:49:25,110 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:25,116 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,135 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 188 [2018-04-09 21:49:25,187 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-09 21:49:25,188 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:25,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 166 [2018-04-09 21:49:25,245 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:49:25,245 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,298 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,322 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,344 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,366 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,389 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,421 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 41 treesize of output 44 [2018-04-09 21:49:25,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,449 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 2 case distinctions, treesize of input 34 treesize of output 64 [2018-04-09 21:49:25,450 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-09 21:49:25,453 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:25,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,465 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 2 case distinctions, treesize of input 36 treesize of output 62 [2018-04-09 21:49:25,466 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,483 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:49:25,510 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 148 [2018-04-09 21:49:25,715 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-04-09 21:49:25,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-09 21:49:25,733 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:25,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 87 [2018-04-09 21:49:25,761 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:25,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 80 [2018-04-09 21:49:25,781 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:25,793 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:49:25,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-04-09 21:49:25,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2018-04-09 21:49:25,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2018-04-09 21:49:25,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2018-04-09 21:49:25,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-04-09 21:49:25,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:25,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 211 [2018-04-09 21:49:25,970 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-09 21:49:25,972 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:25,987 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 184 [2018-04-09 21:49:26,032 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:49:26,032 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-09 21:49:26,053 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:26,115 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:49:26,151 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,183 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,209 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,234 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,263 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 148 [2018-04-09 21:49:26,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 101 [2018-04-09 21:49:26,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 97 [2018-04-09 21:49:26,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2018-04-09 21:49:26,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2018-04-09 21:49:26,503 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 96 [2018-04-09 21:49:26,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,566 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 211 [2018-04-09 21:49:26,628 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-09 21:49:26,629 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:26,640 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-09 21:49:26,649 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:26,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 184 [2018-04-09 21:49:26,711 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:49:26,712 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,772 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,798 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,824 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,851 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,877 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,915 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-04-09 21:49:26,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 80 [2018-04-09 21:49:26,947 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-04-09 21:49:26,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-09 21:49:26,953 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-09 21:49:26,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,970 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:49:26,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 87 [2018-04-09 21:49:26,989 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 3 xjuncts. [2018-04-09 21:49:27,013 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:27,041 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:49:27,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-04-09 21:49:27,221 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-09 21:49:27,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-04-09 21:49:27,224 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 21:49:27,224 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:49:27,228 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:49:27,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:49:27 BoogieIcfgContainer [2018-04-09 21:49:27,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:49:27,229 INFO L168 Benchmark]: Toolchain (without parser) took 264909.78 ms. Allocated memory was 302.0 MB in the beginning and 472.4 MB in the end (delta: 170.4 MB). Free memory was 239.7 MB in the beginning and 362.3 MB in the end (delta: -122.6 MB). Peak memory consumption was 140.3 MB. Max. memory is 5.3 GB. [2018-04-09 21:49:27,230 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:49:27,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.02 ms. Allocated memory is still 302.0 MB. Free memory was 239.7 MB in the beginning and 215.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-09 21:49:27,230 INFO L168 Benchmark]: Boogie Preprocessor took 53.63 ms. Allocated memory is still 302.0 MB. Free memory was 215.5 MB in the beginning and 212.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:49:27,230 INFO L168 Benchmark]: RCFGBuilder took 554.04 ms. Allocated memory was 302.0 MB in the beginning and 458.8 MB in the end (delta: 156.8 MB). Free memory was 212.6 MB in the beginning and 393.0 MB in the end (delta: -180.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-04-09 21:49:27,231 INFO L168 Benchmark]: TraceAbstraction took 263959.47 ms. Allocated memory was 458.8 MB in the beginning and 472.4 MB in the end (delta: 13.6 MB). Free memory was 393.0 MB in the beginning and 362.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 136.9 MB. Max. memory is 5.3 GB. [2018-04-09 21:49:27,232 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 338.02 ms. Allocated memory is still 302.0 MB. Free memory was 239.7 MB in the beginning and 215.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.63 ms. Allocated memory is still 302.0 MB. Free memory was 215.5 MB in the beginning and 212.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 554.04 ms. Allocated memory was 302.0 MB in the beginning and 458.8 MB in the end (delta: 156.8 MB). Free memory was 212.6 MB in the beginning and 393.0 MB in the end (delta: -180.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 263959.47 ms. Allocated memory was 458.8 MB in the beginning and 472.4 MB in the end (delta: 13.6 MB). Free memory was 393.0 MB in the beginning and 362.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 136.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 87 locations, 19 error locations. TIMEOUT Result, 263.9s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 159.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2428 SDtfs, 7062 SDslu, 19594 SDs, 0 SdLazy, 16799 SolverSat, 1194 SolverUnsat, 204 SolverUnknown, 0 SolverNotchecked, 60.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4516 GetRequests, 3274 SyntacticMatches, 119 SemanticMatches, 1123 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12372 ImplicationChecksByTransitivity, 145.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=35, 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.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 699 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 62.0s InterpolantComputationTime, 2025 NumberOfCodeBlocks, 2025 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3980 ConstructedInterpolants, 650 QuantifiedInterpolants, 2805169 SizeOfPredicates, 410 NumberOfNonLiveVariables, 6414 ConjunctsInSsa, 642 ConjunctsInUnsatCore, 70 InterpolantComputations, 30 PerfectInterpolantSequences, 1658/2732 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/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-49-27-238.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-49-27-238.csv Completed graceful shutdown