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-35b68b2 [2018-04-06 20:57:21,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 20:57:21,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 20:57:21,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 20:57:21,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 20:57:21,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 20:57:21,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 20:57:21,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 20:57:21,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 20:57:21,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 20:57:21,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 20:57:21,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 20:57:21,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 20:57:21,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 20:57:21,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 20:57:21,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 20:57:21,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 20:57:21,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 20:57:21,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 20:57:21,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 20:57:21,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 20:57:21,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 20:57:21,541 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 20:57:21,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 20:57:21,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 20:57:21,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 20:57:21,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 20:57:21,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 20:57:21,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 20:57:21,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 20:57:21,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 20:57:21,547 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-06 20:57:21,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 20:57:21,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 20:57:21,571 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 20:57:21,572 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 20:57:21,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 20:57:21,572 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 20:57:21,572 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 20:57:21,572 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 20:57:21,573 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 20:57:21,573 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 20:57:21,573 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 20:57:21,573 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 20:57:21,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 20:57:21,573 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 20:57:21,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 20:57:21,575 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 20:57:21,575 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 20:57:21,575 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 20:57:21,575 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 20:57:21,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:57:21,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 20:57:21,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:57:21,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 20:57:21,577 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 20:57:21,578 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 20:57:21,578 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 20:57:21,578 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 20:57:21,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 20:57:21,622 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 20:57:21,625 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 20:57:21,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 20:57:21,626 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 20:57:21,627 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-06 20:57:21,926 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ca3d6b87 [2018-04-06 20:57:22,102 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 20:57:22,102 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 20:57:22,103 INFO L168 CDTParser]: Scanning 960521-1_1_true-valid-memsafety.i [2018-04-06 20:57:22,114 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 20:57:22,114 INFO L215 ultiparseSymbolTable]: [2018-04-06 20:57:22,114 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 20:57:22,115 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_1_true-valid-memsafety.i [2018-04-06 20:57:22,115 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-06 20:57:22,115 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 20:57:22,115 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-06 20:57:22,115 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-06 20:57:22,115 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-06 20:57:22,115 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-06 20:57:22,115 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,116 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,117 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,118 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,119 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,120 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,121 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,122 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,123 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,124 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,125 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,126 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-06 20:57:22,127 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-06 20:57:22,127 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-06 20:57:22,127 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-06 20:57:22,146 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ca3d6b87 [2018-04-06 20:57:22,150 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 20:57:22,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 20:57:22,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 20:57:22,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 20:57:22,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 20:57:22,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617617f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22, skipping insertion in model container [2018-04-06 20:57:22,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,175 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:57:22,206 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:57:22,399 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:57:22,440 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:57:22,449 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 20:57:22,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22 WrapperNode [2018-04-06 20:57:22,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 20:57:22,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 20:57:22,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 20:57:22,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 20:57:22,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (1/1) ... [2018-04-06 20:57:22,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 20:57:22,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 20:57:22,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 20:57:22,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 20:57:22,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (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-06 20:57:22,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 20:57:22,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 20:57:22,676 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-06 20:57:22,676 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 20:57:22,677 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 20:57:22,678 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 20:57:22,679 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 20:57:22,680 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 20:57:22,681 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 20:57:22,682 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 20:57:22,683 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 20:57:22,684 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 20:57:22,685 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 20:57:22,686 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 20:57:22,687 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 20:57:22,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 20:57:22,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 20:57:22,689 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 20:57:23,075 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 20:57:23,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:57:23 BoogieIcfgContainer [2018-04-06 20:57:23,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 20:57:23,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 20:57:23,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 20:57:23,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 20:57:23,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 08:57:22" (1/3) ... [2018-04-06 20:57:23,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422ad24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:57:23, skipping insertion in model container [2018-04-06 20:57:23,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:57:22" (2/3) ... [2018-04-06 20:57:23,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422ad24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:57:23, skipping insertion in model container [2018-04-06 20:57:23,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:57:23" (3/3) ... [2018-04-06 20:57:23,082 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-04-06 20:57:23,089 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 20:57:23,096 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-06 20:57:23,134 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 20:57:23,135 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 20:57:23,135 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 20:57:23,135 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 20:57:23,135 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 20:57:23,135 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 20:57:23,135 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 20:57:23,135 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 20:57:23,135 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 20:57:23,136 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 20:57:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-06 20:57:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 20:57:23,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:23,157 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-06 20:57:23,157 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-06 20:57:23,162 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-06 20:57:23,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:23,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:23,240 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-06 20:57:23,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:23,258 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-06 20:57:23,281 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:23,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 20:57:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-06 20:57:23,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-06 20:57:23,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 20:57:23,295 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2018-04-06 20:57:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:23,320 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-06 20:57:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-06 20:57:23,321 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-04-06 20:57:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:23,328 INFO L225 Difference]: With dead ends: 156 [2018-04-06 20:57:23,329 INFO L226 Difference]: Without dead ends: 84 [2018-04-06 20:57:23,333 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-06 20:57:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-06 20:57:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-06 20:57:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-06 20:57:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-04-06 20:57:23,369 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 18 [2018-04-06 20:57:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:23,369 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-04-06 20:57:23,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-06 20:57:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-04-06 20:57:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 20:57:23,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:23,370 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-06 20:57:23,370 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-06 20:57:23,371 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-06 20:57:23,377 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:23,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:23,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:57:23,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:23,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:23,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:57:23,520 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-06 20:57:23,520 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:23,539 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-06 20:57:23,564 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:23,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 20:57:23,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 20:57:23,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 20:57:23,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:57:23,567 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 5 states. [2018-04-06 20:57:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:23,680 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-04-06 20:57:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 20:57:23,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-06 20:57:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:23,683 INFO L225 Difference]: With dead ends: 84 [2018-04-06 20:57:23,683 INFO L226 Difference]: Without dead ends: 80 [2018-04-06 20:57:23,684 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-06 20:57:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-06 20:57:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-06 20:57:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-06 20:57:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-04-06 20:57:23,693 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2018-04-06 20:57:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:23,693 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-04-06 20:57:23,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 20:57:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-04-06 20:57:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 20:57:23,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:23,695 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-06 20:57:23,695 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-06 20:57:23,695 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-06 20:57:23,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:23,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:23,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:23,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:23,771 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-06 20:57:23,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:57:23,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:23,910 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-06 20:57:23,945 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:23,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 20:57:23,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 20:57:23,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 20:57:23,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:57:23,946 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 9 states. [2018-04-06 20:57:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:24,217 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-06 20:57:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 20:57:24,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-06 20:57:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:24,219 INFO L225 Difference]: With dead ends: 149 [2018-04-06 20:57:24,219 INFO L226 Difference]: Without dead ends: 148 [2018-04-06 20:57:24,220 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-06 20:57:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-06 20:57:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 91. [2018-04-06 20:57:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-06 20:57:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-04-06 20:57:24,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2018-04-06 20:57:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:24,231 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-04-06 20:57:24,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 20:57:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-04-06 20:57:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 20:57:24,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:24,233 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-06 20:57:24,233 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-06 20:57:24,233 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-06 20:57:24,240 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:24,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:24,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:57:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:57:24,314 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-06 20:57:24,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,318 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-06 20:57:24,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 20:57:24,330 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-06 20:57:24,331 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:24,372 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-06 20:57:24,393 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:24,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:57:24,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:57:24,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:57:24,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:57:24,394 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 4 states. [2018-04-06 20:57:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:24,475 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-04-06 20:57:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:57:24,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-06 20:57:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:24,476 INFO L225 Difference]: With dead ends: 91 [2018-04-06 20:57:24,476 INFO L226 Difference]: Without dead ends: 88 [2018-04-06 20:57:24,477 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-06 20:57:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-06 20:57:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-06 20:57:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-06 20:57:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-04-06 20:57:24,485 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 28 [2018-04-06 20:57:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:24,486 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-04-06 20:57:24,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:57:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-04-06 20:57:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 20:57:24,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:24,487 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-06 20:57:24,487 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-06 20:57:24,487 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-06 20:57:24,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:24,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:24,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:57:24,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:24,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-06 20:57:24,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:24,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:24,577 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-06 20:57:24,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:24,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,600 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-06 20:57:24,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-06 20:57:24,738 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-06 20:57:24,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:24,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:24,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,819 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-06 20:57:24,828 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-06 20:57:24,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:24,832 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-06 20:57:24,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-06 20:57:24,837 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-06 20:57:24,856 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:24,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-06 20:57:24,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:57:24,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:57:24,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:57:24,857 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-04-06 20:57:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:27,155 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2018-04-06 20:57:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-06 20:57:27,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-06 20:57:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:27,160 INFO L225 Difference]: With dead ends: 194 [2018-04-06 20:57:27,160 INFO L226 Difference]: Without dead ends: 153 [2018-04-06 20:57:27,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=301, Unknown=2, NotChecked=0, Total=420 [2018-04-06 20:57:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-06 20:57:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2018-04-06 20:57:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-06 20:57:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-04-06 20:57:27,174 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 28 [2018-04-06 20:57:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:27,174 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-04-06 20:57:27,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:57:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-04-06 20:57:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 20:57:27,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:27,175 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-06 20:57:27,175 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-06 20:57:27,176 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-06 20:57:27,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:27,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:27,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 20:57:27,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:27,225 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-06 20:57:27,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:27,252 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-06 20:57:27,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:27,311 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-06 20:57:27,335 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:27,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-06 20:57:27,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:57:27,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:57:27,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:57:27,336 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 13 states. [2018-04-06 20:57:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:27,718 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-04-06 20:57:27,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 20:57:27,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-06 20:57:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:27,719 INFO L225 Difference]: With dead ends: 143 [2018-04-06 20:57:27,719 INFO L226 Difference]: Without dead ends: 142 [2018-04-06 20:57:27,720 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-06 20:57:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-06 20:57:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2018-04-06 20:57:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-06 20:57:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-04-06 20:57:27,730 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 28 [2018-04-06 20:57:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:27,730 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-04-06 20:57:27,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:57:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-04-06 20:57:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 20:57:27,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:27,731 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-06 20:57:27,731 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-06 20:57:27,731 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-06 20:57:27,738 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:27,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:27,795 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-06 20:57:27,795 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:27,819 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-06 20:57:27,841 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:27,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-06 20:57:27,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 20:57:27,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 20:57:27,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:57:27,842 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 9 states. [2018-04-06 20:57:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:27,993 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-04-06 20:57:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 20:57:27,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-06 20:57:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:27,994 INFO L225 Difference]: With dead ends: 180 [2018-04-06 20:57:27,995 INFO L226 Difference]: Without dead ends: 135 [2018-04-06 20:57:27,995 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-06 20:57:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-06 20:57:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2018-04-06 20:57:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-06 20:57:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-04-06 20:57:28,006 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 34 [2018-04-06 20:57:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:28,006 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-04-06 20:57:28,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 20:57:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-04-06 20:57:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 20:57:28,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:28,008 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-06 20:57:28,008 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-06 20:57:28,008 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-06 20:57:28,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:28,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:28,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:28,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:28,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-06 20:57:28,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:28,120 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-06 20:57:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:28,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:28,138 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-06 20:57:28,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,147 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-06 20:57:28,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-06 20:57:28,243 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-06 20:57:28,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:28,366 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-06 20:57:28,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,370 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-06 20:57:28,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:28,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:28,386 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-06 20:57:28,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-06 20:57:28,418 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-06 20:57:28,440 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:28,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 16 [2018-04-06 20:57:28,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:57:28,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:57:28,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:57:28,441 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 17 states. [2018-04-06 20:57:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:29,341 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-04-06 20:57:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-06 20:57:29,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-04-06 20:57:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:29,343 INFO L225 Difference]: With dead ends: 185 [2018-04-06 20:57:29,343 INFO L226 Difference]: Without dead ends: 144 [2018-04-06 20:57:29,344 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-06 20:57:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-06 20:57:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2018-04-06 20:57:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-06 20:57:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-04-06 20:57:29,354 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 35 [2018-04-06 20:57:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:29,354 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-04-06 20:57:29,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:57:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-04-06 20:57:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 20:57:29,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:29,356 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-06 20:57:29,356 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-06 20:57:29,356 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-06 20:57:29,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:29,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:29,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:29,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:29,409 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-06 20:57:29,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:29,481 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-06 20:57:29,482 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:29,579 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-06 20:57:29,601 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:29,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-06 20:57:29,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:57:29,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:57:29,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:57:29,602 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 13 states. [2018-04-06 20:57:29,904 WARN L148 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-06 20:57:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:30,093 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-04-06 20:57:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:57:30,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-06 20:57:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:30,094 INFO L225 Difference]: With dead ends: 138 [2018-04-06 20:57:30,094 INFO L226 Difference]: Without dead ends: 136 [2018-04-06 20:57:30,095 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-06 20:57:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-06 20:57:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-04-06 20:57:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-06 20:57:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-04-06 20:57:30,104 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 39 [2018-04-06 20:57:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:30,105 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-04-06 20:57:30,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:57:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-04-06 20:57:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 20:57:30,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:30,107 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-06 20:57:30,107 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-06 20:57:30,107 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-06 20:57:30,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:30,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:30,181 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-06 20:57:30,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:30,202 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-06 20:57:30,225 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:30,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-06 20:57:30,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 20:57:30,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 20:57:30,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:57:30,226 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 5 states. [2018-04-06 20:57:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:30,295 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-04-06 20:57:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:57:30,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-04-06 20:57:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:30,296 INFO L225 Difference]: With dead ends: 136 [2018-04-06 20:57:30,296 INFO L226 Difference]: Without dead ends: 135 [2018-04-06 20:57:30,296 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-06 20:57:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-06 20:57:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2018-04-06 20:57:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-06 20:57:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-04-06 20:57:30,306 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 40 [2018-04-06 20:57:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:30,306 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-04-06 20:57:30,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 20:57:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-04-06 20:57:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 20:57:30,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:30,308 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-06 20:57:30,308 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-06 20:57:30,308 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-06 20:57:30,315 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:30,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:30,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:30,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:30,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:30,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:30,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, 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-06 20:57:30,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:30,399 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-06 20:57:30,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-06 20:57:30,470 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-06 20:57:30,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:31,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:31,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:31,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,162 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-06 20:57:31,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 20:57:31,173 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-06 20:57:31,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:31,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-06 20:57:31,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:57:31,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:57:31,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=217, Unknown=2, NotChecked=0, Total=272 [2018-04-06 20:57:31,202 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 17 states. [2018-04-06 20:57:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:31,568 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-04-06 20:57:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:57:31,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-06 20:57:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:31,570 INFO L225 Difference]: With dead ends: 188 [2018-04-06 20:57:31,570 INFO L226 Difference]: Without dead ends: 147 [2018-04-06 20:57:31,571 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-06 20:57:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-06 20:57:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2018-04-06 20:57:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-06 20:57:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-04-06 20:57:31,583 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 41 [2018-04-06 20:57:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:31,583 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-04-06 20:57:31,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:57:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-04-06 20:57:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 20:57:31,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:31,585 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-06 20:57:31,585 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-06 20:57:31,585 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-06 20:57:31,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:31,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:31,627 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-06 20:57:31,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:31,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,641 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-06 20:57:31,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-06 20:57:31,647 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-06 20:57:31,647 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:31,653 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-06 20:57:31,659 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-06 20:57:31,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:31,663 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-06 20:57:31,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-04-06 20:57:31,670 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-06 20:57:31,692 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:31,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-06 20:57:31,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:57:31,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:57:31,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:57:31,692 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 6 states. [2018-04-06 20:57:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:31,812 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-04-06 20:57:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 20:57:31,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-04-06 20:57:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:31,813 INFO L225 Difference]: With dead ends: 144 [2018-04-06 20:57:31,813 INFO L226 Difference]: Without dead ends: 131 [2018-04-06 20:57:31,813 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-06 20:57:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-06 20:57:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2018-04-06 20:57:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-06 20:57:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-04-06 20:57:31,820 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 47 [2018-04-06 20:57:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:31,821 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-04-06 20:57:31,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:57:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-04-06 20:57:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 20:57:31,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:31,822 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-06 20:57:31,822 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-06 20:57:31,822 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-06 20:57:31,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:31,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:31,907 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-06 20:57:31,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:31,965 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-06 20:57:31,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:31,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-06 20:57:31,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 20:57:31,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 20:57:31,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-06 20:57:31,992 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 15 states. [2018-04-06 20:57:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:32,295 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-04-06 20:57:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 20:57:32,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-04-06 20:57:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:32,298 INFO L225 Difference]: With dead ends: 255 [2018-04-06 20:57:32,298 INFO L226 Difference]: Without dead ends: 208 [2018-04-06 20:57:32,298 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-06 20:57:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-06 20:57:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2018-04-06 20:57:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-06 20:57:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-04-06 20:57:32,312 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 47 [2018-04-06 20:57:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:32,312 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-04-06 20:57:32,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 20:57:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-04-06 20:57:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-06 20:57:32,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:32,313 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-06 20:57:32,313 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-06 20:57:32,314 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-06 20:57:32,324 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:32,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:32,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:32,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:57:32,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:32,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:32,370 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-06 20:57:32,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-06 20:57:32,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:32,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, 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-06 20:57:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,398 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-06 20:57:32,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-06 20:57:32,409 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-06 20:57:32,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:32,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:32,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-06 20:57:32,454 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-06 20:57:32,474 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:32,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-06 20:57:32,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 20:57:32,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 20:57:32,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:57:32,475 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 12 states. [2018-04-06 20:57:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:32,656 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-04-06 20:57:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:57:32,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-06 20:57:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:32,657 INFO L225 Difference]: With dead ends: 169 [2018-04-06 20:57:32,657 INFO L226 Difference]: Without dead ends: 167 [2018-04-06 20:57:32,658 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-06 20:57:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-06 20:57:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-04-06 20:57:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-06 20:57:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2018-04-06 20:57:32,674 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 48 [2018-04-06 20:57:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:32,674 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2018-04-06 20:57:32,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 20:57:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2018-04-06 20:57:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 20:57:32,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:32,675 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-06 20:57:32,675 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-06 20:57:32,676 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-06 20:57:32,684 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:32,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:32,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:32,758 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-06 20:57:32,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:32,863 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-06 20:57:32,863 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:32,983 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-06 20:57:33,005 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:33,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2018-04-06 20:57:33,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:57:33,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:57:33,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:57:33,006 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 17 states. [2018-04-06 20:57:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:33,400 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-04-06 20:57:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:57:33,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-06 20:57:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:33,401 INFO L225 Difference]: With dead ends: 176 [2018-04-06 20:57:33,401 INFO L226 Difference]: Without dead ends: 173 [2018-04-06 20:57:33,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-04-06 20:57:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-06 20:57:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-04-06 20:57:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-06 20:57:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-04-06 20:57:33,412 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 50 [2018-04-06 20:57:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:33,412 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-04-06 20:57:33,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:57:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-04-06 20:57:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-06 20:57:33,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:33,413 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-06 20:57:33,413 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-06 20:57:33,413 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-06 20:57:33,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:33,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:33,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:33,508 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-06 20:57:33,515 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-06 20:57:33,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:33,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:33,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:33,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-06 20:57:33,556 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-06 20:57:33,564 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-06 20:57:33,574 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-06 20:57:33,574 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:33,646 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-06 20:57:33,656 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-06 20:57:33,660 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-06 20:57:33,675 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-06 20:57:33,706 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:57:33,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-06 20:57:33,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 20:57:33,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 20:57:33,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-06 20:57:33,707 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 18 states. [2018-04-06 20:57:33,736 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-06 20:57:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:34,091 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2018-04-06 20:57:34,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:57:34,091 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-04-06 20:57:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:34,092 INFO L225 Difference]: With dead ends: 169 [2018-04-06 20:57:34,092 INFO L226 Difference]: Without dead ends: 130 [2018-04-06 20:57:34,093 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-06 20:57:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-06 20:57:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-04-06 20:57:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-06 20:57:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-06 20:57:34,111 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 51 [2018-04-06 20:57:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:34,111 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-06 20:57:34,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 20:57:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-06 20:57:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 20:57:34,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:34,112 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-06 20:57:34,112 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-06 20:57:34,112 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-06 20:57:34,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:34,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:34,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:34,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:34,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:34,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 20:57:34,223 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-06 20:57:34,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:34,232 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-06 20:57:34,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-06 20:57:34,351 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-06 20:57:34,351 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:34,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:34,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:34,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:34,788 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-06 20:57:34,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 20:57:34,808 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-06 20:57:34,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:34,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-06 20:57:34,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 20:57:34,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 20:57:34,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=426, Unknown=1, NotChecked=0, Total=506 [2018-04-06 20:57:34,831 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2018-04-06 20:57:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:35,511 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2018-04-06 20:57:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 20:57:35,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-06 20:57:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:35,513 INFO L225 Difference]: With dead ends: 206 [2018-04-06 20:57:35,513 INFO L226 Difference]: Without dead ends: 168 [2018-04-06 20:57:35,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=1085, Unknown=1, NotChecked=0, Total=1332 [2018-04-06 20:57:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-06 20:57:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2018-04-06 20:57:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-06 20:57:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-04-06 20:57:35,525 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 54 [2018-04-06 20:57:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:35,526 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-04-06 20:57:35,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-06 20:57:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-04-06 20:57:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-06 20:57:35,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:35,526 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-06 20:57:35,526 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-06 20:57:35,527 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-06 20:57:35,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:35,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:35,589 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-06 20:57:35,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:35,640 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-06 20:57:35,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:35,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-04-06 20:57:35,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:57:35,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:57:35,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:57:35,663 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 11 states. [2018-04-06 20:57:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:35,859 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2018-04-06 20:57:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:57:35,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-04-06 20:57:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:35,860 INFO L225 Difference]: With dead ends: 195 [2018-04-06 20:57:35,860 INFO L226 Difference]: Without dead ends: 162 [2018-04-06 20:57:35,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-04-06 20:57:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-06 20:57:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-04-06 20:57:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-06 20:57:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-04-06 20:57:35,869 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 56 [2018-04-06 20:57:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:35,869 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-04-06 20:57:35,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:57:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-04-06 20:57:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-06 20:57:35,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:35,870 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-06 20:57:35,870 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-06 20:57:35,870 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-06 20:57:35,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:35,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:35,942 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-06 20:57:35,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:35,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-06 20:57:35,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:35,979 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-06 20:57:35,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-04-06 20:57:36,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:36,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:36,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-06 20:57:36,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:36,037 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-06 20:57:36,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-06 20:57:36,131 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-06 20:57:36,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:36,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-04-06 20:57:36,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 20:57:36,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 20:57:36,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-06 20:57:36,154 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 15 states. [2018-04-06 20:57:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:36,463 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-04-06 20:57:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 20:57:36,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-04-06 20:57:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:36,464 INFO L225 Difference]: With dead ends: 164 [2018-04-06 20:57:36,464 INFO L226 Difference]: Without dead ends: 163 [2018-04-06 20:57:36,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-04-06 20:57:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-06 20:57:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2018-04-06 20:57:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-06 20:57:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-04-06 20:57:36,476 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 59 [2018-04-06 20:57:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:36,476 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-04-06 20:57:36,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 20:57:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-04-06 20:57:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 20:57:36,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:36,477 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-06 20:57:36,477 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-06 20:57:36,478 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-06 20:57:36,491 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:36,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:36,574 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-06 20:57:36,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:36,652 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-06 20:57:36,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:36,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-04-06 20:57:36,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 20:57:36,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 20:57:36,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-04-06 20:57:36,685 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-04-06 20:57:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:57:37,141 INFO L93 Difference]: Finished difference Result 283 states and 292 transitions. [2018-04-06 20:57:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-06 20:57:37,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-06 20:57:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:57:37,143 INFO L225 Difference]: With dead ends: 283 [2018-04-06 20:57:37,143 INFO L226 Difference]: Without dead ends: 239 [2018-04-06 20:57:37,144 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-06 20:57:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-06 20:57:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 188. [2018-04-06 20:57:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-06 20:57:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2018-04-06 20:57:37,161 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 60 [2018-04-06 20:57:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:57:37,161 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2018-04-06 20:57:37,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 20:57:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2018-04-06 20:57:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 20:57:37,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:57:37,163 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-06 20:57:37,163 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-06 20:57:37,163 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-06 20:57:37,172 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:57:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:57:37,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:57:37,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:37,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:57:37,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:37,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:37,282 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-06 20:57:37,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-06 20:57:37,332 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-06 20:57:37,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:57:37,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-06 20:57:37,365 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-06 20:57:37,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:37,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-06 20:57:37,604 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-06 20:57:37,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:37,611 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-06 20:57:37,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,639 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-06 20:57:37,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:37,644 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-06 20:57:37,644 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:37,663 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-06 20:57:37,673 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-06 20:57:37,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2018-04-06 20:57:39,823 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-06 20:57:39,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:39,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:39,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:39,827 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-06 20:57:39,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:39,840 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-06 20:57:39,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:39,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:39,849 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-06 20:57:39,849 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:60, output treesize:10 [2018-04-06 20:57:39,882 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-06 20:57:39,883 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:57:47,761 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-06 20:57:47,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:57:47,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:47,807 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-06 20:57:48,110 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 167 DAG size of output 157 [2018-04-06 20:57:48,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:48,119 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-06 20:57:48,135 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-06 20:57:48,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,151 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-06 20:57:48,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:48,152 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:57:48,152 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,163 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,192 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-06 20:57:48,226 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-06 20:57:48,496 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 240 DAG size of output 120 [2018-04-06 20:57:48,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:48,499 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,500 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,500 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-06 20:57:48,501 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,619 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,622 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-06 20:57:48,622 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:48,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,734 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-06 20:57:48,735 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:48,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,754 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-06 20:57:48,756 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:48,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:48,934 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:48,934 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-06 20:57:48,935 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:49,006 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:49,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:49,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:49,009 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-06 20:57:49,009 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,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, 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-06 20:57:49,070 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:49,099 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:49,187 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:49,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 77 [2018-04-06 20:57:49,437 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-04-06 20:57:49,439 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,649 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-06 20:57:49,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:57:49,666 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:57:49,666 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,670 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-06 20:57:49,671 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,690 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-06 20:57:49,691 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:49,702 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,710 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,713 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-06 20:57:49,722 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-06 20:57:49,773 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-06 20:57:49,773 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:57:49,774 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:49,795 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-06 20:57:49,795 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:49,796 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:57:49,796 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:49,820 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:49,839 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:50,090 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-06 20:57:50,094 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-06 20:57:50,110 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-06 20:57:50,110 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,129 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-06 20:57:50,130 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:50,131 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:57:50,131 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,140 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,145 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,176 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-06 20:57:50,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,185 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-06 20:57:50,214 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,215 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-06 20:57:50,216 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,224 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,495 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-06 20:57:50,783 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 249 DAG size of output 137 [2018-04-06 20:57:50,786 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:50,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,790 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-06 20:57:50,790 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:50,915 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,928 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-06 20:57:50,929 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:50,935 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:50,941 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-06 20:57:50,942 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:51,045 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-06 20:57:51,045 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,101 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-06 20:57:51,102 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,178 INFO L267 ElimStorePlain]: Start of recursive call 39: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:51,250 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-06 20:57:51,287 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-06 20:57:51,287 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,293 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,433 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-06 20:57:51,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:51,457 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:57:51,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:57:51,459 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-06 20:57:51,459 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,466 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,564 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-06 20:57:51,596 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-06 20:57:51,597 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:51,671 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-06 20:57:51,671 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:57:51,672 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:51,676 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-06 20:57:51,676 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:51,705 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:51,742 INFO L267 ElimStorePlain]: Start of recursive call 36: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:51,880 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-06 20:57:51,881 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:51,974 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-06 20:57:51,976 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-06 20:57:51,987 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:57:51,987 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,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, 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-06 20:57:52,001 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,023 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-06 20:57:52,024 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,045 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,061 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:57:52,066 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-06 20:57:52,079 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-06 20:57:52,080 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,093 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-06 20:57:52,094 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,117 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-06 20:57:52,118 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,141 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,160 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:52,242 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-06 20:57:52,316 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-06 20:57:52,329 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-06 20:57:52,329 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,357 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-06 20:57:52,358 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,375 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-06 20:57:52,376 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,399 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,420 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:52,559 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:57:52,561 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 20:57:52,750 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-06 20:57:52,773 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-06 20:57:52,773 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,794 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-06 20:57:52,795 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,796 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-06 20:57:52,796 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,833 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-06 20:57:52,834 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,835 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-06 20:57:52,835 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:52,856 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,869 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,877 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-06 20:57:52,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-06 20:57:52,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-06 20:57:52,897 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-06 20:57:52,898 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:52,912 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-06 20:57:52,912 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:52,937 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-06 20:57:52,938 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,964 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:52,986 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:53,018 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-06 20:57:53,024 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-06 20:57:53,057 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-06 20:57:53,057 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-06 20:57:53,062 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-06 20:57:53,062 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:53,097 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-06 20:57:53,097 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:57:53,098 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 3 xjuncts. [2018-04-06 20:57:53,127 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:57:53,149 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:57:53,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-06 20:57:53,193 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:53,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:57:53,195 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-06 20:57:53,233 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 20:57:53,290 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-06 20:57:53,339 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-06 20:57:53,339 INFO L202 ElimStorePlain]: Needed 91 recursive calls to eliminate 4 variables, input treesize:98, output treesize:146 [2018-04-06 20:57:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:57:53,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:57:53,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-06 20:57:53,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-06 20:57:53,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-06 20:57:53,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1134, Unknown=25, NotChecked=0, Total=1406 [2018-04-06 20:57:53,762 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand 38 states. [2018-04-06 20:58:09,639 WARN L151 SmtUtils]: Spent 4038ms on a formula simplification. DAG size of input: 46 DAG size of output 44 [2018-04-06 20:58:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:14,119 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2018-04-06 20:58:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-06 20:58:14,119 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-04-06 20:58:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:14,120 INFO L225 Difference]: With dead ends: 212 [2018-04-06 20:58:14,120 INFO L226 Difference]: Without dead ends: 200 [2018-04-06 20:58:14,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=780, Invalid=3160, Unknown=92, NotChecked=0, Total=4032 [2018-04-06 20:58:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-06 20:58:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2018-04-06 20:58:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-06 20:58:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2018-04-06 20:58:14,142 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 66 [2018-04-06 20:58:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:14,142 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2018-04-06 20:58:14,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-06 20:58:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2018-04-06 20:58:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-06 20:58:14,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:14,143 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-06 20:58:14,143 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-06 20:58:14,143 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-06 20:58:14,155 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:14,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:14,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 20:58:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:14,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:14,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 20:58:14,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:58:14,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:14,239 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-06 20:58:14,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-06 20:58:14,400 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-06 20:58:14,401 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:14,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:58:14,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:58:14,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:14,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:14,878 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-06 20:58:14,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 20:58:14,904 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-06 20:58:14,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:14,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-04-06 20:58:14,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-06 20:58:14,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-06 20:58:14,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=702, Unknown=1, NotChecked=0, Total=812 [2018-04-06 20:58:14,926 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand 29 states. [2018-04-06 20:58:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:15,999 INFO L93 Difference]: Finished difference Result 276 states and 283 transitions. [2018-04-06 20:58:15,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 20:58:15,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-06 20:58:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:16,000 INFO L225 Difference]: With dead ends: 276 [2018-04-06 20:58:16,000 INFO L226 Difference]: Without dead ends: 238 [2018-04-06 20:58:16,001 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-06 20:58:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-06 20:58:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2018-04-06 20:58:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-06 20:58:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-04-06 20:58:16,022 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 67 [2018-04-06 20:58:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:16,022 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-04-06 20:58:16,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-06 20:58:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-04-06 20:58:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-06 20:58:16,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:16,024 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-06 20:58:16,024 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-06 20:58:16,024 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-06 20:58:16,030 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:16,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:16,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:58:16,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:16,097 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-06 20:58:16,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 20:58:16,250 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-06 20:58:16,251 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:16,403 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-06 20:58:16,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:16,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-06 20:58:16,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 20:58:16,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 20:58:16,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-06 20:58:16,425 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 23 states. [2018-04-06 20:58:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:17,094 INFO L93 Difference]: Finished difference Result 251 states and 260 transitions. [2018-04-06 20:58:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-06 20:58:17,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-06 20:58:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:17,095 INFO L225 Difference]: With dead ends: 251 [2018-04-06 20:58:17,095 INFO L226 Difference]: Without dead ends: 222 [2018-04-06 20:58:17,096 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-06 20:58:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-06 20:58:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 207. [2018-04-06 20:58:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-06 20:58:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 214 transitions. [2018-04-06 20:58:17,110 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 214 transitions. Word has length 69 [2018-04-06 20:58:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:17,111 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 214 transitions. [2018-04-06 20:58:17,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-06 20:58:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-04-06 20:58:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-06 20:58:17,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:17,111 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-06 20:58:17,111 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-06 20:58:17,112 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-06 20:58:17,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:17,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:17,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:17,185 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-06 20:58:17,186 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-06 20:58:17,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:17,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:17,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:17,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-06 20:58:17,215 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-06 20:58:17,218 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-06 20:58:17,227 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-06 20:58:17,227 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:17,266 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-06 20:58:17,268 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-06 20:58:17,271 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-06 20:58:17,291 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-06 20:58:17,312 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:58:17,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-06 20:58:17,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 20:58:17,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 20:58:17,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-06 20:58:17,313 INFO L87 Difference]: Start difference. First operand 207 states and 214 transitions. Second operand 18 states. [2018-04-06 20:58:17,334 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-06 20:58:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:17,637 INFO L93 Difference]: Finished difference Result 209 states and 216 transitions. [2018-04-06 20:58:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:58:17,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-04-06 20:58:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:17,638 INFO L225 Difference]: With dead ends: 209 [2018-04-06 20:58:17,638 INFO L226 Difference]: Without dead ends: 154 [2018-04-06 20:58:17,638 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-06 20:58:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-06 20:58:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-06 20:58:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-06 20:58:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-04-06 20:58:17,656 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 70 [2018-04-06 20:58:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:17,656 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-04-06 20:58:17,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 20:58:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-04-06 20:58:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-06 20:58:17,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:17,657 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-06 20:58:17,657 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-06 20:58:17,658 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-06 20:58:17,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:17,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:17,790 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-06 20:58:17,790 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:17,893 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-06 20:58:17,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:17,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-04-06 20:58:17,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-06 20:58:17,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-06 20:58:17,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-04-06 20:58:17,915 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 27 states. [2018-04-06 20:58:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:18,553 INFO L93 Difference]: Finished difference Result 281 states and 287 transitions. [2018-04-06 20:58:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-06 20:58:18,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 73 [2018-04-06 20:58:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:18,555 INFO L225 Difference]: With dead ends: 281 [2018-04-06 20:58:18,555 INFO L226 Difference]: Without dead ends: 244 [2018-04-06 20:58:18,556 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-06 20:58:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-06 20:58:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2018-04-06 20:58:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-06 20:58:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 225 transitions. [2018-04-06 20:58:18,599 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 225 transitions. Word has length 73 [2018-04-06 20:58:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:18,600 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 225 transitions. [2018-04-06 20:58:18,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-06 20:58:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 225 transitions. [2018-04-06 20:58:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-06 20:58:18,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:18,601 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-06 20:58:18,602 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-06 20:58:18,602 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-06 20:58:18,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:18,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:18,708 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-06 20:58:18,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:18,765 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-06 20:58:18,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:18,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-04-06 20:58:18,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:58:18,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:58:18,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:58:18,788 INFO L87 Difference]: Start difference. First operand 217 states and 225 transitions. Second operand 17 states. [2018-04-06 20:58:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:19,043 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2018-04-06 20:58:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 20:58:19,043 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-04-06 20:58:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:19,045 INFO L225 Difference]: With dead ends: 247 [2018-04-06 20:58:19,045 INFO L226 Difference]: Without dead ends: 227 [2018-04-06 20:58:19,045 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-06 20:58:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-06 20:58:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2018-04-06 20:58:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-06 20:58:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 222 transitions. [2018-04-06 20:58:19,062 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 222 transitions. Word has length 75 [2018-04-06 20:58:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:19,063 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 222 transitions. [2018-04-06 20:58:19,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:58:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 222 transitions. [2018-04-06 20:58:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-06 20:58:19,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:19,063 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-06 20:58:19,063 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-06 20:58:19,064 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-06 20:58:19,070 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:19,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:19,160 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-06 20:58:19,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:19,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:58:19,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:19,209 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-06 20:58:19,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-04-06 20:58:19,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-06 20:58:19,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:19,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-06 20:58:19,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:19,265 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-06 20:58:19,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-06 20:58:19,444 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-06 20:58:19,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:19,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-06 20:58:19,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 20:58:19,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 20:58:19,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-04-06 20:58:19,465 INFO L87 Difference]: Start difference. First operand 216 states and 222 transitions. Second operand 23 states. [2018-04-06 20:58:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:20,091 INFO L93 Difference]: Finished difference Result 227 states and 232 transitions. [2018-04-06 20:58:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 20:58:20,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-04-06 20:58:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:20,092 INFO L225 Difference]: With dead ends: 227 [2018-04-06 20:58:20,092 INFO L226 Difference]: Without dead ends: 226 [2018-04-06 20:58:20,092 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-06 20:58:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-06 20:58:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-04-06 20:58:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-06 20:58:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2018-04-06 20:58:20,109 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 78 [2018-04-06 20:58:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:20,109 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2018-04-06 20:58:20,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-06 20:58:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2018-04-06 20:58:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-06 20:58:20,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:20,110 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-06 20:58:20,110 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-06 20:58:20,110 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-06 20:58:20,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:20,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:20,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:58:20,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:20,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:20,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 20:58:20,208 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-06 20:58:20,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:20,214 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-06 20:58:20,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-06 20:58:20,453 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-06 20:58:20,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:21,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:58:21,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:58:21,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:21,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:21,075 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-06 20:58:21,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 20:58:21,123 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-06 20:58:21,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:58:21,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-04-06 20:58:21,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 20:58:21,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 20:58:21,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1046, Unknown=1, NotChecked=0, Total=1190 [2018-04-06 20:58:21,145 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand 35 states. [2018-04-06 20:58:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:58:22,465 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2018-04-06 20:58:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-06 20:58:22,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-04-06 20:58:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:58:22,466 INFO L225 Difference]: With dead ends: 280 [2018-04-06 20:58:22,466 INFO L226 Difference]: Without dead ends: 249 [2018-04-06 20:58:22,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=2997, Unknown=1, NotChecked=0, Total=3540 [2018-04-06 20:58:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-06 20:58:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 224. [2018-04-06 20:58:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-06 20:58:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-04-06 20:58:22,484 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 80 [2018-04-06 20:58:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:58:22,484 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-04-06 20:58:22,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-06 20:58:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-04-06 20:58:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-06 20:58:22,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:58:22,485 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-06 20:58:22,485 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-06 20:58:22,485 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-06 20:58:22,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:58:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:58:22,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:58:22,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:58:22,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:58:22,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:22,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:22,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:58:22,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-06 20:58:22,603 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-06 20:58:22,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:58:22,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-06 20:58:22,625 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-06 20:58:22,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:58:22,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:22,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-06 20:58:23,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:58:23,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-06 20:58:23,045 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-06 20:58:23,050 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-06 20:58:23,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-06 20:58:23,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:23,088 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-06 20:58:23,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:23,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:23,092 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-06 20:58:23,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,100 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:23,120 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-06 20:58:23,134 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-06 20:58:23,134 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:86, output treesize:67 [2018-04-06 20:58:25,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-04-06 20:58:25,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:25,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:25,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:58:25,263 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:25,263 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-06 20:58:25,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:25,279 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-06 20:58:25,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:25,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:25,285 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-06 20:58:25,286 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:82, output treesize:10 [2018-04-06 20:58:25,328 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-06 20:58:25,328 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:58:33,665 WARN L148 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-06 20:58:41,309 WARN L148 SmtUtils]: Spent 719ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-06 20:58:55,718 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-06 20:58:55,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 20:58:55,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:55,753 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-06 20:58:55,757 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-06 20:58:55,762 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-06 20:58:55,770 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-06 20:58:55,781 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-06 20:58:55,799 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:55,855 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-06 20:58:55,855 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-06 20:58:55,856 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:55,906 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-06 20:58:55,907 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:55,920 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-06 20:58:55,920 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:55,965 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:55,990 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:58:56,081 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:56,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:58:56,117 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-06 20:58:56,122 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-06 20:58:56,130 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-06 20:58:56,172 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-06 20:58:56,172 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,179 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-06 20:58:56,180 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:56,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:56,225 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-06 20:58:56,225 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 20:58:56,226 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:56,265 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:58:56,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,309 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,328 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 20:58:56,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 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-06 20:58:56,406 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-06 20:58:56,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:56,444 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-06 20:58:56,445 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:56,449 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-06 20:58:56,449 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:56,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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-06 20:58:56,463 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:58:56,492 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-06 20:58:56,510 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-06 20:58:56,561 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-06 20:58:56,561 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,564 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:56,623 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-06 20:58:56,623 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-06 20:58:56,624 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:56,635 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-06 20:58:56,635 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:56,671 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,691 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,710 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,732 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:58:56,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:58:56,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-06 20:58:56,863 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-06 20:58:56,886 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-06 20:58:56,887 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:56,918 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-06 20:58:56,919 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:56,922 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:56,967 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-06 20:58:56,968 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 20:58:56,968 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:57,004 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,020 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,037 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,060 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,203 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-06 20:58:57,226 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-06 20:58:57,234 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-06 20:58:57,246 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-06 20:58:57,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,323 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-06 20:58:57,323 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-06 20:58:57,324 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:57,362 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-06 20:58:57,363 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,397 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-06 20:58:57,397 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:57,437 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,457 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,476 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,507 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-06 20:58:57,508 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:57,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,527 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-06 20:58:57,528 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:57,542 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-06 20:58:57,543 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,574 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,691 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-06 20:58:57,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-06 20:58:57,713 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:57,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,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, 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-06 20:58:57,734 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:57,748 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-06 20:58:57,748 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,779 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,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, 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-06 20:58:57,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, 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-06 20:58:57,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, 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-06 20:58:57,898 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-06 20:58:57,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,938 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-06 20:58:57,939 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:57,939 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:58:57,940 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:57,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,943 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:57,986 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-06 20:58:57,986 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:58:57,987 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:58,015 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,029 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,043 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,063 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-04-06 20:58:58,151 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:58:58,310 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:58:58,490 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-06 20:58:58,490 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,492 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:58,497 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-06 20:58:58,498 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,499 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-06 20:58:58,500 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,516 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,742 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-06 20:58:58,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 20:58:58,773 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-06 20:58:58,781 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-06 20:58:58,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:58,842 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-06 20:58:58,843 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 20:58:58,843 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:58,851 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-06 20:58:58,851 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,880 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-06 20:58:58,880 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,916 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,932 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,948 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,975 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-06 20:58:58,975 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:58,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-06 20:58:58,981 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:58,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:58,988 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-06 20:58:58,989 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,013 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,076 INFO L267 ElimStorePlain]: Start of recursive call 20: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 20:58:59,082 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-06 20:58:59,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-06 20:58:59,084 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:59,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:58:59,106 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:59,112 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-06 20:58:59,112 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,113 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-06 20:58:59,114 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:59,119 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-06 20:58:59,119 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,129 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:58:59,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, 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-06 20:58:59,163 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-06 20:58:59,164 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,166 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-06 20:58:59,166 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-06 20:58:59,168 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:58:59,182 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-06 20:58:59,183 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-06 20:58:59,201 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:58:59,214 INFO L267 ElimStorePlain]: Start of recursive call 75: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:58:59,292 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-06 20:58:59,354 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-06 20:58:59,355 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 5 variables, input treesize:122, output treesize:174 [2018-04-06 20:59:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 34 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:59:00,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:59:00,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-04-06 20:59:00,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-06 20:59:00,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-06 20:59:00,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2036, Unknown=61, NotChecked=0, Total=2450 [2018-04-06 20:59:00,590 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 50 states. [2018-04-06 20:59:29,327 WARN L148 SmtUtils]: Spent 22526ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-06 20:59:46,654 WARN L151 SmtUtils]: Spent 3127ms on a formula simplification. DAG size of input: 76 DAG size of output 53 [2018-04-06 21:00:20,374 WARN L151 SmtUtils]: Spent 4063ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-04-06 21:00:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:23,791 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-04-06 21:00:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-06 21:00:23,791 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 85 [2018-04-06 21:00:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:23,792 INFO L225 Difference]: With dead ends: 232 [2018-04-06 21:00:23,792 INFO L226 Difference]: Without dead ends: 173 [2018-04-06 21:00:23,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=1144, Invalid=5323, Unknown=175, NotChecked=0, Total=6642 [2018-04-06 21:00:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-06 21:00:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-06 21:00:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-06 21:00:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2018-04-06 21:00:23,812 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 85 [2018-04-06 21:00:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:23,812 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2018-04-06 21:00:23,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-06 21:00:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2018-04-06 21:00:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-06 21:00:23,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:23,812 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-06 21:00:23,813 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-06 21:00:23,813 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-06 21:00:23,818 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:23,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:23,972 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-06 21:00:23,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:24,115 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-06 21:00:24,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:24,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-04-06 21:00:24,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-06 21:00:24,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-06 21:00:24,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2018-04-06 21:00:24,137 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand 33 states. [2018-04-06 21:00:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:24,753 INFO L93 Difference]: Finished difference Result 306 states and 312 transitions. [2018-04-06 21:00:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-06 21:00:24,753 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2018-04-06 21:00:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:24,755 INFO L225 Difference]: With dead ends: 306 [2018-04-06 21:00:24,755 INFO L226 Difference]: Without dead ends: 269 [2018-04-06 21:00:24,756 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-06 21:00:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-06 21:00:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 242. [2018-04-06 21:00:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-06 21:00:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 250 transitions. [2018-04-06 21:00:24,785 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 250 transitions. Word has length 86 [2018-04-06 21:00:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:24,785 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 250 transitions. [2018-04-06 21:00:24,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-06 21:00:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 250 transitions. [2018-04-06 21:00:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-06 21:00:24,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:24,786 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-06 21:00:24,787 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-06 21:00:24,787 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-06 21:00:24,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:24,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:24,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, 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-06 21:00:24,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:24,852 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-06 21:00:24,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 21:00:25,029 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-06 21:00:25,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:25,246 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-06 21:00:25,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:25,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-04-06 21:00:25,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-06 21:00:25,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-06 21:00:25,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-04-06 21:00:25,268 INFO L87 Difference]: Start difference. First operand 242 states and 250 transitions. Second operand 29 states. [2018-04-06 21:00:26,293 WARN L148 SmtUtils]: Spent 308ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-06 21:00:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:26,340 INFO L93 Difference]: Finished difference Result 284 states and 296 transitions. [2018-04-06 21:00:26,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-06 21:00:26,340 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-04-06 21:00:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:26,342 INFO L225 Difference]: With dead ends: 284 [2018-04-06 21:00:26,342 INFO L226 Difference]: Without dead ends: 266 [2018-04-06 21:00:26,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-04-06 21:00:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-06 21:00:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2018-04-06 21:00:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-06 21:00:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 268 transitions. [2018-04-06 21:00:26,364 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 268 transitions. Word has length 88 [2018-04-06 21:00:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:26,364 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 268 transitions. [2018-04-06 21:00:26,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-06 21:00:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 268 transitions. [2018-04-06 21:00:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-06 21:00:26,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:26,365 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-06 21:00:26,365 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-06 21:00:26,365 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-06 21:00:26,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:26,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:26,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 21:00:26,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:26,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:26,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 21:00:26,488 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-06 21:00:26,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:26,495 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-06 21:00:26,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-06 21:00:26,776 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-06 21:00:26,776 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:27,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-06 21:00: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-06 21:00:27,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:27,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00: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-06 21:00:27,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 21:00:27,367 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-06 21:00:27,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:27,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 40 [2018-04-06 21:00:27,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-06 21:00:27,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-06 21:00:27,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-04-06 21:00:27,389 INFO L87 Difference]: Start difference. First operand 260 states and 268 transitions. Second operand 41 states. [2018-04-06 21:00:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:28,892 INFO L93 Difference]: Finished difference Result 332 states and 337 transitions. [2018-04-06 21:00:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-06 21:00:28,892 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 93 [2018-04-06 21:00:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:28,894 INFO L225 Difference]: With dead ends: 332 [2018-04-06 21:00:28,894 INFO L226 Difference]: Without dead ends: 295 [2018-04-06 21:00:28,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 135 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2018-04-06 21:00:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-06 21:00:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 266. [2018-04-06 21:00:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-06 21:00:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 274 transitions. [2018-04-06 21:00:28,917 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 274 transitions. Word has length 93 [2018-04-06 21:00:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:28,917 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 274 transitions. [2018-04-06 21:00:28,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-06 21:00:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 274 transitions. [2018-04-06 21:00:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-06 21:00:28,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:28,918 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-06 21:00:28,918 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-06 21:00:28,918 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-06 21:00:28,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:28,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:29,028 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-06 21:00:29,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:29,109 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-06 21:00:29,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:29,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-04-06 21:00:29,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 21:00:29,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 21:00:29,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-04-06 21:00:29,132 INFO L87 Difference]: Start difference. First operand 266 states and 274 transitions. Second operand 23 states. [2018-04-06 21:00:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:29,373 INFO L93 Difference]: Finished difference Result 296 states and 302 transitions. [2018-04-06 21:00:29,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-06 21:00:29,373 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-04-06 21:00:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:29,374 INFO L225 Difference]: With dead ends: 296 [2018-04-06 21:00:29,375 INFO L226 Difference]: Without dead ends: 276 [2018-04-06 21:00:29,375 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-06 21:00:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-06 21:00:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 265. [2018-04-06 21:00:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-06 21:00:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 271 transitions. [2018-04-06 21:00:29,404 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 271 transitions. Word has length 94 [2018-04-06 21:00:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:29,404 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 271 transitions. [2018-04-06 21:00:29,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-06 21:00:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 271 transitions. [2018-04-06 21:00:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-06 21:00:29,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:29,405 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-06 21:00:29,405 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-06 21:00:29,405 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-06 21:00:29,411 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:29,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:29,583 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-06 21:00:29,584 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:29,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 21:00:29,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:29,651 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-06 21:00:29,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-04-06 21:00:29,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 21:00:29,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:29,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:00:29,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:29,720 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-06 21:00:29,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-06 21:00:30,254 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-06 21:00:30,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:30,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-04-06 21:00:30,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-06 21:00:30,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-06 21:00:30,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2018-04-06 21:00:30,286 INFO L87 Difference]: Start difference. First operand 265 states and 271 transitions. Second operand 31 states. [2018-04-06 21:00:30,589 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 61 DAG size of output 43 [2018-04-06 21:00:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:31,888 INFO L93 Difference]: Finished difference Result 276 states and 281 transitions. [2018-04-06 21:00:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-06 21:00:31,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-04-06 21:00:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:31,889 INFO L225 Difference]: With dead ends: 276 [2018-04-06 21:00:31,889 INFO L226 Difference]: Without dead ends: 275 [2018-04-06 21:00:31,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2018-04-06 21:00:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-06 21:00:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2018-04-06 21:00:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-06 21:00:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 273 transitions. [2018-04-06 21:00:31,926 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 273 transitions. Word has length 97 [2018-04-06 21:00:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:31,927 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 273 transitions. [2018-04-06 21:00:31,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-06 21:00:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 273 transitions. [2018-04-06 21:00:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-06 21:00:31,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:31,928 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-06 21:00:31,928 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-06 21:00:31,928 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-06 21:00:31,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:31,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:32,160 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-06 21:00:32,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:32,363 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-06 21:00:32,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:00:32,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-04-06 21:00:32,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 21:00:32,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 21:00:32,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 21:00:32,384 INFO L87 Difference]: Start difference. First operand 267 states and 273 transitions. Second operand 39 states. [2018-04-06 21:00:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:00:33,512 INFO L93 Difference]: Finished difference Result 426 states and 432 transitions. [2018-04-06 21:00:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-06 21:00:33,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 99 [2018-04-06 21:00:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:00:33,514 INFO L225 Difference]: With dead ends: 426 [2018-04-06 21:00:33,514 INFO L226 Difference]: Without dead ends: 383 [2018-04-06 21:00:33,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 149 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1519, Invalid=7037, Unknown=0, NotChecked=0, Total=8556 [2018-04-06 21:00:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-06 21:00:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2018-04-06 21:00:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-06 21:00:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 357 transitions. [2018-04-06 21:00:33,561 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 357 transitions. Word has length 99 [2018-04-06 21:00:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:00:33,561 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 357 transitions. [2018-04-06 21:00:33,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 21:00:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 357 transitions. [2018-04-06 21:00:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-06 21:00:33,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:00:33,563 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-06 21:00:33,563 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-06 21:00:33,563 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-06 21:00:33,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:00:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:00:33,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:00:33,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 21:00:33,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:00:33,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:33,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:33,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 21:00:33,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-06 21:00:33,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:00:33,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:00:33,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-06 21:00:33,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:00:33,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 21:00:33,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:33,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-06 21:00:34,784 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-06 21:00:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-04-06 21:00:34,790 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-06 21:00:34,798 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-06 21:00:34,808 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-06 21:00:34,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,855 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-06 21:00:34,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-04-06 21:00:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,865 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-06 21:00:34,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:34,870 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-06 21:00:34,870 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,889 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,896 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,909 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:34,921 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-06 21:00:34,938 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-06 21:00:34,938 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:105, output treesize:95 [2018-04-06 21:00:35,119 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-06 21:00:35,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:00:35,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:00:35,126 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-06 21:00:35,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:35,151 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-06 21:00:35,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 21:00:35,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:00:35,157 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-06 21:00:35,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:110, output treesize:10 [2018-04-06 21:00:35,222 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-06 21:00:35,222 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:00:35,448 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-06 21:00:35,829 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-04-06 21:00:36,606 WARN L148 SmtUtils]: Spent 411ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-06 21:01:00,562 WARN L148 SmtUtils]: Spent 199ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-06 21:01:11,628 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-06 21:01:11,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 21:01:11,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:11,669 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-06 21:01:11,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 21:01:11,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 95 [2018-04-06 21:01:11,680 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-06 21:01:11,689 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-06 21:01:11,700 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-06 21:01:11,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,722 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-06 21:01:11,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,813 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-06 21:01:11,814 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-06 21:01:11,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:11,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,830 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-06 21:01:11,830 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:11,841 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:11,880 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-06 21:01:11,880 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 21:01:11,881 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:11,929 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:11,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:11,978 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,107 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-06 21:01:12,112 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-06 21:01:12,120 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-06 21:01:12,133 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-06 21:01:12,149 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-06 21:01:12,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,168 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-06 21:01:12,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,246 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-06 21:01:12,246 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 21:01:12,246 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,265 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-06 21:01:12,265 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,353 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-06 21:01:12,353 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-06 21:01:12,354 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:12,417 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:01:12,451 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,476 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,502 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,529 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,557 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 21:01:12,632 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 21:01:12,634 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 21:01:12,710 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-06 21:01:12,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 21:01:12,712 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-04-06 21:01:12,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,727 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-06 21:01:12,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,738 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-06 21:01:12,738 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,749 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-06 21:01:12,749 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,764 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-06 21:01:12,764 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,774 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,778 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,790 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-06 21:01:12,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,793 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-06 21:01:12,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,807 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-06 21:01:12,807 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:12,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,810 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,833 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-06 21:01:12,834 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:12,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,851 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-06 21:01:12,851 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,878 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:01:12,891 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:12,906 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:01:12,926 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-06 21:01:12,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:01:12,937 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-06 21:01:12,945 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-06 21:01:12,957 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-06 21:01:12,974 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-06 21:01:12,982 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:12,998 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-06 21:01:13,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,034 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,050 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,118 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-06 21:01:13,119 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-06 21:01:13,148 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:13,162 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,171 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-06 21:01:13,171 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:13,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,233 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-06 21:01:13,234 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 21:01:13,234 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,286 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,310 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,334 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,357 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,381 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,413 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,588 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-06 21:01:13,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:01:13,601 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-06 21:01:13,612 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-06 21:01:13,626 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-06 21:01:13,633 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,642 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-06 21:01:13,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,678 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-06 21:01:13,679 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:13,685 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,755 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-06 21:01:13,755 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-06 21:01:13,756 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:13,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,808 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-06 21:01:13,808 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 21:01:13,809 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,859 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,882 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,906 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,930 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,954 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:13,987 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:13,988 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-06 21:01:14,000 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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-06 21:01:14,013 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,015 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-06 21:01:14,016 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:14,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,028 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-06 21:01:14,028 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,057 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:14,087 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,287 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-06 21:01:14,297 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,298 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-06 21:01:14,313 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,315 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-06 21:01:14,315 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:14,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,343 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-06 21:01:14,343 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:14,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,363 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-06 21:01:14,363 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,376 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:14,389 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-06 21:01:14,397 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-06 21:01:14,409 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-06 21:01:14,425 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-06 21:01:14,432 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,445 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-06 21:01:14,478 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,525 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-06 21:01:14,525 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 21:01:14,526 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,618 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-06 21:01:14,619 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-06 21:01:14,620 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:14,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:14,640 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-06 21:01:14,640 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:14,704 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:01:14,736 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,762 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,788 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,814 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:14,842 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,028 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-06 21:01:15,034 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-06 21:01:15,043 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-06 21:01:15,055 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-06 21:01:15,072 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-06 21:01:15,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,095 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-06 21:01:15,130 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,147 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,208 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-06 21:01:15,208 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-06 21:01:15,209 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:15,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,228 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-06 21:01:15,229 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:15,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,292 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-06 21:01:15,292 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 21:01:15,292 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,354 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,382 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,410 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,438 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,465 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,503 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-06 21:01:15,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,533 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-06 21:01:15,534 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,537 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,539 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-06 21:01:15,539 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:15,544 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,551 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:15,573 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-06 21:01:15,573 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:15,595 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:15,621 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:15,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-04-06 21:01:15,795 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:15,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-04-06 21:01:15,798 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:16,022 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 146 treesize of output 146 [2018-04-06 21:01:16,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,027 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-06 21:01:16,041 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,058 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-06 21:01:16,058 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,066 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,085 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-06 21:01:16,086 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:16,089 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,090 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-06 21:01:16,090 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:16,119 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,133 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,446 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 143 treesize of output 145 [2018-04-06 21:01:16,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,451 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-06 21:01:16,466 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,491 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-06 21:01:16,492 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:16,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,513 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-06 21:01:16,513 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,517 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-06 21:01:16,517 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:16,530 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:01:16,542 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-06 21:01:16,549 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-06 21:01:16,561 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-06 21:01:16,576 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-06 21:01:16,583 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,595 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-06 21:01:16,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,670 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-06 21:01:16,671 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 21:01:16,671 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,681 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,689 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-06 21:01:16,690 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:16,702 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,717 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:16,778 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-06 21:01:16,778 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-04-06 21:01:16,779 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:16,840 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:01:16,872 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,897 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,922 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,947 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:16,972 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2018-04-06 21:01:17,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2018-04-06 21:01:17,143 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 89 treesize of output 85 [2018-04-06 21:01:17,151 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 85 treesize of output 81 [2018-04-06 21:01:17,162 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 81 [2018-04-06 21:01:17,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 81 treesize of output 84 [2018-04-06 21:01:17,195 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:01:17,195 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-06 21:01:17,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,213 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 156 [2018-04-06 21:01:17,234 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,245 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,246 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,246 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,257 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:01:17,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 178 [2018-04-06 21:01:17,297 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-06 21:01:17,297 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 3 xjuncts. [2018-04-06 21:01:17,341 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,364 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,381 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,398 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,415 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,439 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:01:17,595 INFO L267 ElimStorePlain]: Start of recursive call 37: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 21:01:17,687 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-06 21:01:17,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-06 21:01:17,767 INFO L202 ElimStorePlain]: Needed 114 recursive calls to eliminate 6 variables, input treesize:146, output treesize:204 [2018-04-06 21:01:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 68 refuted. 18 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:01:19,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:01:19,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 62 [2018-04-06 21:01:19,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-06 21:01:19,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-06 21:01:19,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=3204, Unknown=95, NotChecked=0, Total=3782 [2018-04-06 21:01:19,393 INFO L87 Difference]: Start difference. First operand 348 states and 357 transitions. Second operand 62 states. Received shutdown request... [2018-04-06 21:01:50,041 WARN L148 SmtUtils]: Spent 12972ms on a formula simplification that was a NOOP. DAG size: 100 [2018-04-06 21:01:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 21:01:50,042 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 21:01:50,048 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 21:01:50,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:01:50 BoogieIcfgContainer [2018-04-06 21:01:50,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 21:01:50,049 INFO L168 Benchmark]: Toolchain (without parser) took 267898.68 ms. Allocated memory was 305.1 MB in the beginning and 541.1 MB in the end (delta: 235.9 MB). Free memory was 243.3 MB in the beginning and 359.7 MB in the end (delta: -116.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 5.3 GB. [2018-04-06 21:01:50,050 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:01:50,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.68 ms. Allocated memory is still 305.1 MB. Free memory was 243.3 MB in the beginning and 218.8 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-04-06 21:01:50,050 INFO L168 Benchmark]: Boogie Preprocessor took 57.62 ms. Allocated memory is still 305.1 MB. Free memory was 218.8 MB in the beginning and 215.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:01:50,051 INFO L168 Benchmark]: RCFGBuilder took 518.79 ms. Allocated memory was 305.1 MB in the beginning and 468.2 MB in the end (delta: 163.1 MB). Free memory was 215.8 MB in the beginning and 403.5 MB in the end (delta: -187.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:01:50,051 INFO L168 Benchmark]: TraceAbstraction took 266971.68 ms. Allocated memory was 468.2 MB in the beginning and 541.1 MB in the end (delta: 72.9 MB). Free memory was 403.5 MB in the beginning and 359.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 116.7 MB. Max. memory is 5.3 GB. [2018-04-06 21:01:50,052 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.19 ms. Allocated memory is still 305.1 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 346.68 ms. Allocated memory is still 305.1 MB. Free memory was 243.3 MB in the beginning and 218.8 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.62 ms. Allocated memory is still 305.1 MB. Free memory was 218.8 MB in the beginning and 215.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 518.79 ms. Allocated memory was 305.1 MB in the beginning and 468.2 MB in the end (delta: 163.1 MB). Free memory was 215.8 MB in the beginning and 403.5 MB in the end (delta: -187.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 266971.68 ms. Allocated memory was 468.2 MB in the beginning and 541.1 MB in the end (delta: 72.9 MB). Free memory was 403.5 MB in the beginning and 359.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 116.7 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 constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 3 states, 62 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 87 locations, 19 error locations. TIMEOUT Result, 266.9s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 153.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2429 SDtfs, 6976 SDslu, 19679 SDs, 0 SdLazy, 16922 SolverSat, 1171 SolverUnsat, 234 SolverUnknown, 0 SolverNotchecked, 55.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4722 GetRequests, 3419 SyntacticMatches, 118 SemanticMatches, 1185 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 13583 ImplicationChecksByTransitivity, 187.5s 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.6s SatisfiabilityAnalysisTime, 110.6s InterpolantComputationTime, 2129 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4186 ConstructedInterpolants, 753 QuantifiedInterpolants, 4206545 SizeOfPredicates, 447 NumberOfNonLiveVariables, 6684 ConjunctsInSsa, 701 ConjunctsInUnsatCore, 72 InterpolantComputations, 30 PerfectInterpolantSequences, 1670/2928 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-06_21-01-50-060.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-06_21-01-50-060.csv Completed graceful shutdown