java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:54:44,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:54:44,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:54:44,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:54:44,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:54:44,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:54:44,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:54:44,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:54:44,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:54:44,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:54:44,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:54:44,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:54:44,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:54:44,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:54:44,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:54:44,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:54:44,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:54:44,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:54:44,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:54:44,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:54:44,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:54:44,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:54:44,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:54:44,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:54:44,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:54:44,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:54:44,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:54:44,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:54:44,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:54:44,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:54:44,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:54:44,392 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 21:54:44,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:54:44,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:54:44,416 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:54:44,416 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:54:44,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:54:44,417 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:54:44,417 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:54:44,417 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:54:44,417 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:54:44,418 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:54:44,418 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:54:44,418 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:54:44,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:54:44,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:54:44,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:54:44,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:54:44,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:54:44,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:54:44,419 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:54:44,420 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:54:44,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:54:44,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:54:44,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:54:44,420 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:54:44,420 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:54:44,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:54:44,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:54:44,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:54:44,421 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:54:44,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:54:44,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:54:44,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:54:44,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:44,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:54:44,423 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:54:44,423 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:54:44,424 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:54:44,424 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:54:44,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:54:44,467 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:54:44,470 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:54:44,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:54:44,472 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:54:44,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,785 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGec63f7628 [2018-04-09 21:54:44,963 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:54:44,963 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:54:44,964 INFO L168 CDTParser]: Scanning test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,974 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:54:44,974 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:54:44,974 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:54:44,974 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,974 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:44,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:45,003 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGec63f7628 [2018-04-09 21:54:45,007 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:54:45,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:54:45,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:54:45,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:54:45,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:54:45,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4ecdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45, skipping insertion in model container [2018-04-09 21:54:45,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,032 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:54:45,062 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:54:45,246 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:54:45,304 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:54:45,312 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-09 21:54:45,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45 WrapperNode [2018-04-09 21:54:45,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:54:45,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:54:45,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:54:45,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:54:45,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... [2018-04-09 21:54:45,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:54:45,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:54:45,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:54:45,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:54:45,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:54:45,562 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:54:45,563 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:54:45,563 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:54:45,563 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:54:45,564 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:54:45,565 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:54:45,566 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:54:45,567 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:54:45,568 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:54:45,569 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:54:45,570 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:54:45,571 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:54:45,572 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:54:45,573 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:54:45,574 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:54:45,575 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 21:54:45,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:54:45,577 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 21:54:45,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:54:45,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:54:45,577 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 21:54:46,207 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:54:46,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:54:46 BoogieIcfgContainer [2018-04-09 21:54:46,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:54:46,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:54:46,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:54:46,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:54:46,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:54:45" (1/3) ... [2018-04-09 21:54:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521bcfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:54:46, skipping insertion in model container [2018-04-09 21:54:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:54:45" (2/3) ... [2018-04-09 21:54:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521bcfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:54:46, skipping insertion in model container [2018-04-09 21:54:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:54:46" (3/3) ... [2018-04-09 21:54:46,214 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-04-09 21:54:46,220 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:54:46,226 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-04-09 21:54:46,269 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:54:46,269 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:54:46,269 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:54:46,270 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:54:46,270 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:54:46,270 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:54:46,270 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:54:46,270 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:54:46,270 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:54:46,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:54:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2018-04-09 21:54:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-09 21:54:46,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:46,295 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:46,295 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:46,301 INFO L82 PathProgramCache]: Analyzing trace with hash -122083506, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:46,320 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:46,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,405 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:46,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:54:46,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 21:54:46,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 21:54:46,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:54:46,419 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 2 states. [2018-04-09 21:54:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:46,450 INFO L93 Difference]: Finished difference Result 391 states and 429 transitions. [2018-04-09 21:54:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 21:54:46,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-04-09 21:54:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:46,463 INFO L225 Difference]: With dead ends: 391 [2018-04-09 21:54:46,464 INFO L226 Difference]: Without dead ends: 197 [2018-04-09 21:54:46,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:54:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-09 21:54:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-04-09 21:54:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-09 21:54:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2018-04-09 21:54:46,515 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 15 [2018-04-09 21:54:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:46,515 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2018-04-09 21:54:46,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 21:54:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2018-04-09 21:54:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 21:54:46,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:46,516 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:46,517 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1649766350, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:46,523 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:46,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,546 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,582 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:46,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:54:46,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:54:46,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:54:46,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:46,585 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand 3 states. [2018-04-09 21:54:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:46,781 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2018-04-09 21:54:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:54:46,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-09 21:54:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:46,786 INFO L225 Difference]: With dead ends: 263 [2018-04-09 21:54:46,786 INFO L226 Difference]: Without dead ends: 260 [2018-04-09 21:54:46,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-09 21:54:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 206. [2018-04-09 21:54:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-09 21:54:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-04-09 21:54:46,805 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 20 [2018-04-09 21:54:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:46,805 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-04-09 21:54:46,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:54:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-04-09 21:54:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 21:54:46,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:46,806 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:46,806 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1649764454, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:46,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:46,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,884 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:46,927 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:46,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:46,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:54:46,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:54:46,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:46,928 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 3 states. [2018-04-09 21:54:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:47,027 INFO L93 Difference]: Finished difference Result 420 states and 453 transitions. [2018-04-09 21:54:47,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:54:47,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-09 21:54:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:47,029 INFO L225 Difference]: With dead ends: 420 [2018-04-09 21:54:47,029 INFO L226 Difference]: Without dead ends: 231 [2018-04-09 21:54:47,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-09 21:54:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-04-09 21:54:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-09 21:54:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 247 transitions. [2018-04-09 21:54:47,044 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 247 transitions. Word has length 20 [2018-04-09 21:54:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:47,044 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 247 transitions. [2018-04-09 21:54:47,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:54:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2018-04-09 21:54:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 21:54:47,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:47,045 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] [2018-04-09 21:54:47,046 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1825600628, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:47,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:47,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,073 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,104 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:47,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:47,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:54:47,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:54:47,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:47,105 INFO L87 Difference]: Start difference. First operand 221 states and 247 transitions. Second operand 3 states. [2018-04-09 21:54:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:47,148 INFO L93 Difference]: Finished difference Result 427 states and 479 transitions. [2018-04-09 21:54:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:54:47,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-09 21:54:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:47,151 INFO L225 Difference]: With dead ends: 427 [2018-04-09 21:54:47,152 INFO L226 Difference]: Without dead ends: 222 [2018-04-09 21:54:47,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:54:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-09 21:54:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-04-09 21:54:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-09 21:54:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2018-04-09 21:54:47,162 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 24 [2018-04-09 21:54:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:47,163 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2018-04-09 21:54:47,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:54:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2018-04-09 21:54:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 21:54:47,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:47,164 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:47,164 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1027262167, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:47,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:47,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:47,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:47,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:47,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:47,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:54:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,253 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,294 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:47,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:47,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:54:47,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:54:47,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:54:47,295 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand 4 states. [2018-04-09 21:54:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:47,697 INFO L93 Difference]: Finished difference Result 313 states and 342 transitions. [2018-04-09 21:54:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:47,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-09 21:54:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:47,700 INFO L225 Difference]: With dead ends: 313 [2018-04-09 21:54:47,700 INFO L226 Difference]: Without dead ends: 307 [2018-04-09 21:54:47,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-09 21:54:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 223. [2018-04-09 21:54:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-09 21:54:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2018-04-09 21:54:47,710 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 26 [2018-04-09 21:54:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:47,711 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2018-04-09 21:54:47,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:54:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2018-04-09 21:54:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 21:54:47,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:47,712 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:47,712 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1027262166, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:47,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:47,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:47,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:47,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:47,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:47,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:54:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,777 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:47,833 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:47,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:54:47,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:54:47,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:54:47,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:54:47,835 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand 6 states. [2018-04-09 21:54:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:48,095 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-04-09 21:54:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:48,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-09 21:54:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:48,097 INFO L225 Difference]: With dead ends: 223 [2018-04-09 21:54:48,097 INFO L226 Difference]: Without dead ends: 219 [2018-04-09 21:54:48,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:54:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-09 21:54:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-04-09 21:54:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-09 21:54:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2018-04-09 21:54:48,103 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 26 [2018-04-09 21:54:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:48,104 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2018-04-09 21:54:48,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:54:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2018-04-09 21:54:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-09 21:54:48,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:48,105 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:48,105 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1162426777, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:48,113 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:48,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,162 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,202 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:48,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 21:54:48,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:54:48,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:54:48,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:54:48,203 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand 8 states. [2018-04-09 21:54:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:48,307 INFO L93 Difference]: Finished difference Result 943 states and 1035 transitions. [2018-04-09 21:54:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 21:54:48,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-09 21:54:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:48,312 INFO L225 Difference]: With dead ends: 943 [2018-04-09 21:54:48,312 INFO L226 Difference]: Without dead ends: 752 [2018-04-09 21:54:48,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:54:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-04-09 21:54:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 252. [2018-04-09 21:54:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 21:54:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2018-04-09 21:54:48,329 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 33 [2018-04-09 21:54:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:48,330 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 285 transitions. [2018-04-09 21:54:48,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:54:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 285 transitions. [2018-04-09 21:54:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:54:48,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:48,331 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:48,331 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1062529458, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:48,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:48,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:48,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:48,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:48,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:48,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:54:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,379 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,413 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:48,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:54:48,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:54:48,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:54:48,414 INFO L87 Difference]: Start difference. First operand 252 states and 285 transitions. Second operand 4 states. [2018-04-09 21:54:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:48,578 INFO L93 Difference]: Finished difference Result 301 states and 335 transitions. [2018-04-09 21:54:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:48,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-09 21:54:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:48,580 INFO L225 Difference]: With dead ends: 301 [2018-04-09 21:54:48,580 INFO L226 Difference]: Without dead ends: 297 [2018-04-09 21:54:48,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-09 21:54:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 248. [2018-04-09 21:54:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-09 21:54:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 278 transitions. [2018-04-09 21:54:48,591 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 278 transitions. Word has length 36 [2018-04-09 21:54:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:48,591 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 278 transitions. [2018-04-09 21:54:48,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:54:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 278 transitions. [2018-04-09 21:54:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:54:48,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:48,592 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:48,592 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1062529457, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:48,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:48,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:48,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:48,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:48,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:48,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:54:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,640 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,680 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:48,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:54:48,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:54:48,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:54:48,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:54:48,681 INFO L87 Difference]: Start difference. First operand 248 states and 278 transitions. Second operand 6 states. [2018-04-09 21:54:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:48,842 INFO L93 Difference]: Finished difference Result 315 states and 348 transitions. [2018-04-09 21:54:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:48,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-09 21:54:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:48,846 INFO L225 Difference]: With dead ends: 315 [2018-04-09 21:54:48,846 INFO L226 Difference]: Without dead ends: 312 [2018-04-09 21:54:48,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:54:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-09 21:54:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 245. [2018-04-09 21:54:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 21:54:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 272 transitions. [2018-04-09 21:54:48,857 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 272 transitions. Word has length 36 [2018-04-09 21:54:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:48,858 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 272 transitions. [2018-04-09 21:54:48,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:54:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 272 transitions. [2018-04-09 21:54:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-09 21:54:48,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:48,859 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:48,859 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -696915825, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:48,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:48,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,916 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:48,964 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:48,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-09 21:54:48,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:54:48,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:54:48,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:48,965 INFO L87 Difference]: Start difference. First operand 245 states and 272 transitions. Second operand 5 states. [2018-04-09 21:54:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:49,032 INFO L93 Difference]: Finished difference Result 528 states and 575 transitions. [2018-04-09 21:54:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:49,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-04-09 21:54:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:49,035 INFO L225 Difference]: With dead ends: 528 [2018-04-09 21:54:49,035 INFO L226 Difference]: Without dead ends: 388 [2018-04-09 21:54:49,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:54:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-09 21:54:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 245. [2018-04-09 21:54:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 21:54:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 271 transitions. [2018-04-09 21:54:49,047 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 271 transitions. Word has length 49 [2018-04-09 21:54:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:49,047 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 271 transitions. [2018-04-09 21:54:49,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:54:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 271 transitions. [2018-04-09 21:54:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 21:54:49,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:49,049 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:49,049 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1847609708, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:49,059 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:49,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,103 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,159 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:49,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:54:49,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:54:49,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:54:49,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:49,160 INFO L87 Difference]: Start difference. First operand 245 states and 271 transitions. Second operand 5 states. [2018-04-09 21:54:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:49,340 INFO L93 Difference]: Finished difference Result 585 states and 649 transitions. [2018-04-09 21:54:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:54:49,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-09 21:54:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:49,343 INFO L225 Difference]: With dead ends: 585 [2018-04-09 21:54:49,343 INFO L226 Difference]: Without dead ends: 375 [2018-04-09 21:54:49,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:54:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-09 21:54:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 242. [2018-04-09 21:54:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-09 21:54:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2018-04-09 21:54:49,356 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 51 [2018-04-09 21:54:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:49,358 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2018-04-09 21:54:49,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:54:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2018-04-09 21:54:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 21:54:49,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:49,360 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:49,360 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1847611604, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:49,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:49,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,430 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,473 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:49,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:49,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:54:49,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:54:49,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:54:49,474 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand 4 states. [2018-04-09 21:54:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:49,694 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2018-04-09 21:54:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:49,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-09 21:54:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:49,696 INFO L225 Difference]: With dead ends: 246 [2018-04-09 21:54:49,697 INFO L226 Difference]: Without dead ends: 237 [2018-04-09 21:54:49,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-09 21:54:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-04-09 21:54:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-09 21:54:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 258 transitions. [2018-04-09 21:54:49,711 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 258 transitions. Word has length 51 [2018-04-09 21:54:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:49,711 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 258 transitions. [2018-04-09 21:54:49,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:54:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 258 transitions. [2018-04-09 21:54:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 21:54:49,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:49,712 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:49,712 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1847611605, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:49,723 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:49,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,788 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:49,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-09 21:54:49,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:54:49,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-09 21:54:49,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:49,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:54:49,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-09 21:54:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:49,945 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:49,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-09 21:54:49,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:54:49,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:54:49,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:54:49,946 INFO L87 Difference]: Start difference. First operand 236 states and 258 transitions. Second operand 9 states. [2018-04-09 21:54:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:50,412 INFO L93 Difference]: Finished difference Result 360 states and 396 transitions. [2018-04-09 21:54:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:54:50,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-04-09 21:54:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:50,415 INFO L225 Difference]: With dead ends: 360 [2018-04-09 21:54:50,415 INFO L226 Difference]: Without dead ends: 350 [2018-04-09 21:54:50,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:54:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-09 21:54:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 238. [2018-04-09 21:54:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-09 21:54:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 258 transitions. [2018-04-09 21:54:50,428 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 258 transitions. Word has length 51 [2018-04-09 21:54:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:50,428 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 258 transitions. [2018-04-09 21:54:50,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:54:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 258 transitions. [2018-04-09 21:54:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 21:54:50,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:50,429 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:50,430 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:50,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1115645900, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:50,439 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:50,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:50,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:54:50,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:54:50,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-09 21:54:50,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:54:50,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:50,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:54:50,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-09 21:54:50,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:54:50,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:54:50,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-09 21:54:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:50,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:50,842 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:54:50,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:50,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:1 [2018-04-09 21:54:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:50,886 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:50,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2018-04-09 21:54:50,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:54:50,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:54:50,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:54:50,887 INFO L87 Difference]: Start difference. First operand 238 states and 258 transitions. Second operand 11 states. [2018-04-09 21:54:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:51,326 INFO L93 Difference]: Finished difference Result 332 states and 356 transitions. [2018-04-09 21:54:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:54:51,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-04-09 21:54:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:51,328 INFO L225 Difference]: With dead ends: 332 [2018-04-09 21:54:51,328 INFO L226 Difference]: Without dead ends: 331 [2018-04-09 21:54:51,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:54:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-09 21:54:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 259. [2018-04-09 21:54:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-09 21:54:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 282 transitions. [2018-04-09 21:54:51,338 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 282 transitions. Word has length 58 [2018-04-09 21:54:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:51,338 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 282 transitions. [2018-04-09 21:54:51,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:54:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 282 transitions. [2018-04-09 21:54:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 21:54:51,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:51,339 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:51,339 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1115645901, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:51,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:51,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:51,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:54:51,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:54:51,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:54:51,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:54:51,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-09 21:54:51,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:54:51,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:51,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:54:51,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:54:51,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:51,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:54:51,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-09 21:54:51,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:54:51,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:54:51,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:54:51,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:54:51,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2018-04-09 21:54:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:51,700 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:51,799 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:54:51,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:51,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:1 [2018-04-09 21:54:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:51,845 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:51,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-09 21:54:51,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 21:54:51,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 21:54:51,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-09 21:54:51,847 INFO L87 Difference]: Start difference. First operand 259 states and 282 transitions. Second operand 12 states. [2018-04-09 21:54:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:52,089 INFO L93 Difference]: Finished difference Result 477 states and 515 transitions. [2018-04-09 21:54:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 21:54:52,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-09 21:54:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:52,092 INFO L225 Difference]: With dead ends: 477 [2018-04-09 21:54:52,092 INFO L226 Difference]: Without dead ends: 346 [2018-04-09 21:54:52,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-09 21:54:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-09 21:54:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 253. [2018-04-09 21:54:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-09 21:54:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 274 transitions. [2018-04-09 21:54:52,105 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 274 transitions. Word has length 58 [2018-04-09 21:54:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:52,106 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 274 transitions. [2018-04-09 21:54:52,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 21:54:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2018-04-09 21:54:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 21:54:52,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:52,107 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:52,107 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash -978064352, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:52,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:52,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:52,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:52,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-09 21:54:52,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 21:54:52,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-09 21:54:52,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-09 21:54:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:52,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:52,319 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 14 treesize of output 12 [2018-04-09 21:54:52,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:54:52,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,323 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 14 treesize of output 12 [2018-04-09 21:54:52,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:54:52,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:54:52,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-09 21:54:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:52,418 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:52,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 17 [2018-04-09 21:54:52,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:54:52,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:54:52,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:54:52,419 INFO L87 Difference]: Start difference. First operand 253 states and 274 transitions. Second operand 17 states. [2018-04-09 21:54:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:52,906 INFO L93 Difference]: Finished difference Result 350 states and 377 transitions. [2018-04-09 21:54:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 21:54:52,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-04-09 21:54:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:52,908 INFO L225 Difference]: With dead ends: 350 [2018-04-09 21:54:52,908 INFO L226 Difference]: Without dead ends: 347 [2018-04-09 21:54:52,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 21:54:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-09 21:54:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 257. [2018-04-09 21:54:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-09 21:54:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 278 transitions. [2018-04-09 21:54:52,922 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 278 transitions. Word has length 63 [2018-04-09 21:54:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:52,922 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 278 transitions. [2018-04-09 21:54:52,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:54:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 278 transitions. [2018-04-09 21:54:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 21:54:52,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:52,923 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:52,924 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -978063709, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:52,934 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:52,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:52,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:52,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:52,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:54:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:54:53,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-09 21:54:53,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:53,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:53,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:53,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:53,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2018-04-09 21:54:53,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:54:53,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,176 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 22 treesize of output 16 [2018-04-09 21:54:53,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 7 [2018-04-09 21:54:53,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-04-09 21:54:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:53,247 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:53,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-09 21:54:53,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:53,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,370 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 26 treesize of output 24 [2018-04-09 21:54:53,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:53,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,378 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 26 treesize of output 24 [2018-04-09 21:54:53,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:53,380 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:53,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-09 21:54:53,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-09 21:54:53,443 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 21:54:53,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-09 21:54:53,456 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,474 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,476 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 20 treesize of output 18 [2018-04-09 21:54:53,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-09 21:54:53,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,480 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:53,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:54:53,506 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:67, output treesize:33 [2018-04-09 21:54:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:54,413 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:54,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 12] imperfect sequences [] total 20 [2018-04-09 21:54:54,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:54:54,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:54:54,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=334, Unknown=3, NotChecked=0, Total=420 [2018-04-09 21:54:54,414 INFO L87 Difference]: Start difference. First operand 257 states and 278 transitions. Second operand 21 states. [2018-04-09 21:54:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:55,252 INFO L93 Difference]: Finished difference Result 347 states and 374 transitions. [2018-04-09 21:54:55,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 21:54:55,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-09 21:54:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:55,254 INFO L225 Difference]: With dead ends: 347 [2018-04-09 21:54:55,254 INFO L226 Difference]: Without dead ends: 346 [2018-04-09 21:54:55,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=405, Invalid=1152, Unknown=3, NotChecked=0, Total=1560 [2018-04-09 21:54:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-09 21:54:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 259. [2018-04-09 21:54:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-09 21:54:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 281 transitions. [2018-04-09 21:54:55,263 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 281 transitions. Word has length 63 [2018-04-09 21:54:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:55,263 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 281 transitions. [2018-04-09 21:54:55,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:54:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 281 transitions. [2018-04-09 21:54:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 21:54:55,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:55,264 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:55,264 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -978063710, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:55,273 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:55,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:55,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:55,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:55,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:54:55,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-09 21:54:55,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:55,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:55,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-09 21:54:55,360 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 25 treesize of output 19 [2018-04-09 21:54:55,367 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 19 treesize of output 10 [2018-04-09 21:54:55,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-04-09 21:54:55,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:54:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-09 21:54:55,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:55,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:55,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-09 21:54:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:55,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:55,469 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 14 treesize of output 12 [2018-04-09 21:54:55,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-04-09 21:54:55,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:55,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:55,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-09 21:54:55,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:71 [2018-04-09 21:54:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:55,580 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:55,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 17 [2018-04-09 21:54:55,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 21:54:55,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 21:54:55,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:54:55,581 INFO L87 Difference]: Start difference. First operand 259 states and 281 transitions. Second operand 18 states. [2018-04-09 21:54:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:56,152 INFO L93 Difference]: Finished difference Result 344 states and 368 transitions. [2018-04-09 21:54:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:54:56,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-04-09 21:54:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:56,154 INFO L225 Difference]: With dead ends: 344 [2018-04-09 21:54:56,154 INFO L226 Difference]: Without dead ends: 343 [2018-04-09 21:54:56,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:54:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-09 21:54:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 270. [2018-04-09 21:54:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-09 21:54:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2018-04-09 21:54:56,170 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 63 [2018-04-09 21:54:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:56,170 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2018-04-09 21:54:56,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 21:54:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2018-04-09 21:54:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:54:56,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:56,171 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:56,172 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:56,172 INFO L82 PathProgramCache]: Analyzing trace with hash -437623102, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:56,180 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:56,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:54:56,215 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:56,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-09 21:54:56,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 21:54:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:54:56,255 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:56,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:54:56,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:54:56,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:54:56,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:54:56,256 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand 4 states. [2018-04-09 21:54:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:56,393 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-04-09 21:54:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:54:56,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-09 21:54:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:56,394 INFO L225 Difference]: With dead ends: 325 [2018-04-09 21:54:56,394 INFO L226 Difference]: Without dead ends: 320 [2018-04-09 21:54:56,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:54:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-09 21:54:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 270. [2018-04-09 21:54:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-09 21:54:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 296 transitions. [2018-04-09 21:54:56,410 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 296 transitions. Word has length 66 [2018-04-09 21:54:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:56,410 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 296 transitions. [2018-04-09 21:54:56,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:54:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 296 transitions. [2018-04-09 21:54:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:54:56,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:56,411 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:56,412 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -437623101, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:56,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:56,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:54:56,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:54:56,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:54:56,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:54:56,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-09 21:54:56,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:56,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:56,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:54:56,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:54:56,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2018-04-09 21:54:56,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:56,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:54:56,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,697 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 22 treesize of output 16 [2018-04-09 21:54:56,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 7 [2018-04-09 21:54:56,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:56,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-04-09 21:54:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:56,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:54:56,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:54:56,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:54:56,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:56,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:54:56,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:54:56,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:54:56,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:54:56,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:54:56,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:29 [2018-04-09 21:54:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:54:57,890 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:54:57,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 13] imperfect sequences [] total 23 [2018-04-09 21:54:57,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 21:54:57,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 21:54:57,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=455, Unknown=3, NotChecked=0, Total=552 [2018-04-09 21:54:57,891 INFO L87 Difference]: Start difference. First operand 270 states and 296 transitions. Second operand 24 states. [2018-04-09 21:54:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:54:59,896 INFO L93 Difference]: Finished difference Result 528 states and 571 transitions. [2018-04-09 21:54:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-09 21:54:59,897 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-04-09 21:54:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:54:59,898 INFO L225 Difference]: With dead ends: 528 [2018-04-09 21:54:59,898 INFO L226 Difference]: Without dead ends: 524 [2018-04-09 21:54:59,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=736, Invalid=2921, Unknown=3, NotChecked=0, Total=3660 [2018-04-09 21:54:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-09 21:54:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 281. [2018-04-09 21:54:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-09 21:54:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2018-04-09 21:54:59,909 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 66 [2018-04-09 21:54:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:54:59,909 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2018-04-09 21:54:59,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 21:54:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2018-04-09 21:54:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 21:54:59,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:54:59,910 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:54:59,910 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:54:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash 429590002, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:54:59,919 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:54:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:54:59,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:00,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 21:55:00,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:55:00,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-09 21:55:00,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:00,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:00,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:00,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:00,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2018-04-09 21:55:00,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-09 21:55:00,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-09 21:55:00,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-09 21:55:00,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 20 [2018-04-09 21:55:00,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-09 21:55:00,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:55:00,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-09 21:55:00,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:00,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:11 [2018-04-09 21:55:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:00,342 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:00,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:55:00,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:55:00,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,516 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 25 treesize of output 21 [2018-04-09 21:55:00,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-09 21:55:00,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:00,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:00,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:91 [2018-04-09 21:55:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:00,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:00,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-04-09 21:55:00,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-09 21:55:00,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-09 21:55:00,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 21:55:00,773 INFO L87 Difference]: Start difference. First operand 281 states and 308 transitions. Second operand 33 states. [2018-04-09 21:55:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:03,070 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2018-04-09 21:55:03,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-09 21:55:03,070 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-04-09 21:55:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:03,072 INFO L225 Difference]: With dead ends: 698 [2018-04-09 21:55:03,072 INFO L226 Difference]: Without dead ends: 665 [2018-04-09 21:55:03,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1241, Invalid=5565, Unknown=0, NotChecked=0, Total=6806 [2018-04-09 21:55:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-09 21:55:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 366. [2018-04-09 21:55:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-09 21:55:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 403 transitions. [2018-04-09 21:55:03,090 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 403 transitions. Word has length 76 [2018-04-09 21:55:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:03,090 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 403 transitions. [2018-04-09 21:55:03,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-09 21:55:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 403 transitions. [2018-04-09 21:55:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-09 21:55:03,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:03,091 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:03,092 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1241523921, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:03,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:03,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:03,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 21:55:03,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:55:03,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-09 21:55:03,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:03,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:03,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:03,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:03,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2018-04-09 21:55:03,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-09 21:55:03,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-09 21:55:03,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-09 21:55:03,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 20 [2018-04-09 21:55:03,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-09 21:55:03,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:55:03,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-09 21:55:03,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:11 [2018-04-09 21:55:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:03,504 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:03,751 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 47 DAG size of output 37 [2018-04-09 21:55:03,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:55:03,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:55:03,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-09 21:55:03,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-09 21:55:03,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:03,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:03,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:91 [2018-04-09 21:55:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:04,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:04,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-04-09 21:55:04,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-09 21:55:04,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-09 21:55:04,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 21:55:04,248 INFO L87 Difference]: Start difference. First operand 366 states and 403 transitions. Second operand 33 states. [2018-04-09 21:55:05,330 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-09 21:55:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:06,778 INFO L93 Difference]: Finished difference Result 1027 states and 1131 transitions. [2018-04-09 21:55:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-09 21:55:06,780 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 78 [2018-04-09 21:55:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:06,783 INFO L225 Difference]: With dead ends: 1027 [2018-04-09 21:55:06,783 INFO L226 Difference]: Without dead ends: 999 [2018-04-09 21:55:06,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=700, Invalid=3722, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 21:55:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-04-09 21:55:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 374. [2018-04-09 21:55:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-09 21:55:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 411 transitions. [2018-04-09 21:55:06,811 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 411 transitions. Word has length 78 [2018-04-09 21:55:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:06,812 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 411 transitions. [2018-04-09 21:55:06,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-09 21:55:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 411 transitions. [2018-04-09 21:55:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 21:55:06,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:06,813 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:06,813 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:06,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2141517654, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:06,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:06,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:06,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:06,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-04-09 21:55:07,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-04-09 21:55:07,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-04-09 21:55:07,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:07,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-04-09 21:55:07,144 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~data~0.base Int) (main_~item2~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~0.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~0.base 0) main_~item2~0.base 0)) (= 0 (select |c_old(#valid)| main_~item2~0.base)) (= 0 (select .cse0 main_~data~0.base))))) is different from true [2018-04-09 21:55:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:55:07,163 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:07,290 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 34 treesize of output 30 [2018-04-09 21:55:07,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-04-09 21:55:07,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-09 21:55:07,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-04-09 21:55:07,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-09 21:55:07,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-09 21:55:07,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:07,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-09 21:55:07,344 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:54, output treesize:205 [2018-04-09 21:55:07,517 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_12| Int) (|v_main_#t~malloc4.base_14| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc3.base_12| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_14| 0))) (or (not (= 1 (select .cse0 |v_main_#t~malloc3.base_12|))) (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_12| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_14|))))))) is different from false [2018-04-09 21:55:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-04-09 21:55:07,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:07,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-04-09 21:55:07,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-09 21:55:07,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-09 21:55:07,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=570, Unknown=6, NotChecked=98, Total=756 [2018-04-09 21:55:07,575 INFO L87 Difference]: Start difference. First operand 374 states and 411 transitions. Second operand 28 states. [2018-04-09 21:55:07,608 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc3.base_12| Int) (|v_main_#t~malloc4.base_14| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc3.base_12| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_14| 0))) (or (not (= 1 (select .cse0 |v_main_#t~malloc3.base_12|))) (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_12| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_14|))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:55:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:08,921 INFO L93 Difference]: Finished difference Result 447 states and 489 transitions. [2018-04-09 21:55:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 21:55:08,921 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-04-09 21:55:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:08,923 INFO L225 Difference]: With dead ends: 447 [2018-04-09 21:55:08,923 INFO L226 Difference]: Without dead ends: 442 [2018-04-09 21:55:08,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=1490, Unknown=9, NotChecked=246, Total=1980 [2018-04-09 21:55:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-09 21:55:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 395. [2018-04-09 21:55:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-09 21:55:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-04-09 21:55:08,944 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 81 [2018-04-09 21:55:08,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:08,945 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-04-09 21:55:08,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-09 21:55:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-04-09 21:55:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 21:55:08,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:08,946 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:08,946 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2141518297, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:08,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:08,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:08,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:08,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:08,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:08,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:08,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:08,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:08,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:08,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-09 21:55:09,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:09,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:09,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:55:09,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-09 21:55:09,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-09 21:55:09,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:09,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-09 21:55:09,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:09,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:42 [2018-04-09 21:55:09,114 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 28 treesize of output 27 [2018-04-09 21:55:09,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:09,116 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:09,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, 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 30 [2018-04-09 21:55:09,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,139 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 28 treesize of output 27 [2018-04-09 21:55:09,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:09,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:55:09,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:96 [2018-04-09 21:55:09,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-04-09 21:55:09,226 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 38 treesize of output 27 [2018-04-09 21:55:09,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:09,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-09 21:55:09,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:09,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-04-09 21:55:09,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:09,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-09 21:55:09,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:09,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:55:09,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,262 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:7 [2018-04-09 21:55:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:09,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:09,590 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:55:09,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:09,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:103, output treesize:1 [2018-04-09 21:55:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:09,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:09,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-04-09 21:55:09,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 21:55:09,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 21:55:09,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=426, Unknown=5, NotChecked=0, Total=506 [2018-04-09 21:55:09,633 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 23 states. [2018-04-09 21:55:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:10,875 INFO L93 Difference]: Finished difference Result 454 states and 500 transitions. [2018-04-09 21:55:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-09 21:55:10,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-04-09 21:55:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:10,877 INFO L225 Difference]: With dead ends: 454 [2018-04-09 21:55:10,877 INFO L226 Difference]: Without dead ends: 378 [2018-04-09 21:55:10,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1444, Unknown=8, NotChecked=0, Total=1806 [2018-04-09 21:55:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-09 21:55:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 349. [2018-04-09 21:55:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-09 21:55:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 385 transitions. [2018-04-09 21:55:10,892 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 385 transitions. Word has length 81 [2018-04-09 21:55:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:10,893 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 385 transitions. [2018-04-09 21:55:10,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 21:55:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 385 transitions. [2018-04-09 21:55:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-09 21:55:10,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:10,894 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:10,894 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash 822591320, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:10,906 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:10,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:10,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:11,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:11,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-04-09 21:55:11,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:55:11,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:55:11,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:55:11,003 INFO L87 Difference]: Start difference. First operand 349 states and 385 transitions. Second operand 9 states. [2018-04-09 21:55:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:11,098 INFO L93 Difference]: Finished difference Result 1303 states and 1447 transitions. [2018-04-09 21:55:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:55:11,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-04-09 21:55:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:11,101 INFO L225 Difference]: With dead ends: 1303 [2018-04-09 21:55:11,101 INFO L226 Difference]: Without dead ends: 1000 [2018-04-09 21:55:11,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:55:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-04-09 21:55:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 469. [2018-04-09 21:55:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-09 21:55:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 513 transitions. [2018-04-09 21:55:11,119 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 513 transitions. Word has length 85 [2018-04-09 21:55:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:11,119 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 513 transitions. [2018-04-09 21:55:11,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:55:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 513 transitions. [2018-04-09 21:55:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-09 21:55:11,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:11,119 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:11,120 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1598361566, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:11,134 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:11,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:11,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:11,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:11,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:55:11,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:55:11,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:11,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:11,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:11,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 21:55:11,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-09 21:55:11,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:11,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:11,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-09 21:55:11,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-09 21:55:11,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:55:11,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:11,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-04-09 21:55:11,341 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 57 treesize of output 37 [2018-04-09 21:55:11,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:55:11,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,348 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 19 treesize of output 10 [2018-04-09 21:55:11,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:5 [2018-04-09 21:55:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:11,374 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:11,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-09 21:55:11,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:11,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:55:11,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:11,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-09 21:55:11,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:55:11,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,432 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:55:11,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:55:11,453 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:25 [2018-04-09 21:55:11,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-09 21:55:11,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-04-09 21:55:11,544 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:11,544 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-04-09 21:55:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:11,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:11,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-09 21:55:11,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:55:11,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:55:11,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:55:11,577 INFO L87 Difference]: Start difference. First operand 469 states and 513 transitions. Second operand 21 states. [2018-04-09 21:55:20,212 WARN L151 SmtUtils]: Spent 4018ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-04-09 21:55:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:22,588 INFO L93 Difference]: Finished difference Result 551 states and 598 transitions. [2018-04-09 21:55:22,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 21:55:22,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-04-09 21:55:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:22,590 INFO L225 Difference]: With dead ends: 551 [2018-04-09 21:55:22,590 INFO L226 Difference]: Without dead ends: 550 [2018-04-09 21:55:22,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 21:55:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-04-09 21:55:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 473. [2018-04-09 21:55:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-09 21:55:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 518 transitions. [2018-04-09 21:55:22,615 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 518 transitions. Word has length 88 [2018-04-09 21:55:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:22,615 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 518 transitions. [2018-04-09 21:55:22,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:55:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 518 transitions. [2018-04-09 21:55:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-09 21:55:22,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:22,616 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:22,616 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1598361567, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:22,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:22,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:22,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:55:22,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-09 21:55:22,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:22,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:22,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:22,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-09 21:55:22,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-09 21:55:22,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:22,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:22,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:22,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:22,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-09 21:55:22,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-04-09 21:55:22,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-09 21:55:22,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-04-09 21:55:22,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-09 21:55:22,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:55 [2018-04-09 21:55:22,839 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 39 [2018-04-09 21:55:22,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-04-09 21:55:22,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,885 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 12 treesize of output 4 [2018-04-09 21:55:22,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,928 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 28 treesize of output 22 [2018-04-09 21:55:22,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-09 21:55:22,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:22,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:69, output treesize:13 [2018-04-09 21:55:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:22,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:22,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-04-09 21:55:22,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:55:23,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-09 21:55:23,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:55:23,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:77 [2018-04-09 21:55:23,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-09 21:55:23,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:23,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,091 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 8 treesize of output 6 [2018-04-09 21:55:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:23,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-04-09 21:55:23,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:23,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,139 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 8 treesize of output 6 [2018-04-09 21:55:23,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:23,141 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,141 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,163 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 41 treesize of output 34 [2018-04-09 21:55:23,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 9 treesize of output 8 [2018-04-09 21:55:23,182 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,189 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 8 treesize of output 6 [2018-04-09 21:55:23,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:23,190 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,191 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,197 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:23,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:55:23,213 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:122, output treesize:13 [2018-04-09 21:55:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:24,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:24,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-04-09 21:55:24,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:55:24,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:55:24,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=316, Unknown=3, NotChecked=0, Total=380 [2018-04-09 21:55:24,987 INFO L87 Difference]: Start difference. First operand 473 states and 518 transitions. Second operand 20 states. [2018-04-09 21:55:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:25,884 INFO L93 Difference]: Finished difference Result 595 states and 653 transitions. [2018-04-09 21:55:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 21:55:25,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-04-09 21:55:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:25,887 INFO L225 Difference]: With dead ends: 595 [2018-04-09 21:55:25,888 INFO L226 Difference]: Without dead ends: 594 [2018-04-09 21:55:25,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=388, Invalid=1249, Unknown=3, NotChecked=0, Total=1640 [2018-04-09 21:55:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-04-09 21:55:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 473. [2018-04-09 21:55:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-09 21:55:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 517 transitions. [2018-04-09 21:55:25,917 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 517 transitions. Word has length 88 [2018-04-09 21:55:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:25,918 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 517 transitions. [2018-04-09 21:55:25,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:55:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 517 transitions. [2018-04-09 21:55:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-09 21:55:25,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:25,919 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:25,919 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1460764208, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:25,929 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:25,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:26,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:26,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:26,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:55:26,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:55:26,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:26,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:26,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:26,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 21:55:26,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-09 21:55:26,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:26,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-09 21:55:26,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-09 21:55:26,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:55:26,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:26,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-04-09 21:55:26,186 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 48 treesize of output 30 [2018-04-09 21:55:26,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:55:26,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-09 21:55:26,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:26,209 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-04-09 21:55:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:26,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:28,283 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 34 treesize of output 28 [2018-04-09 21:55:28,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:28,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,327 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 22 treesize of output 18 [2018-04-09 21:55:28,329 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 13 treesize of output 4 [2018-04-09 21:55:28,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-09 21:55:28,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:28,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:55:28,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:55:28,349 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:14 [2018-04-09 21:55:28,408 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:28,408 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-04-09 21:55:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:28,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:55:28,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-04-09 21:55:28,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 21:55:28,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 21:55:28,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2018-04-09 21:55:28,440 INFO L87 Difference]: Start difference. First operand 473 states and 517 transitions. Second operand 18 states. [2018-04-09 21:55:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:47,312 INFO L93 Difference]: Finished difference Result 606 states and 664 transitions. [2018-04-09 21:55:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 21:55:47,313 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-04-09 21:55:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:47,314 INFO L225 Difference]: With dead ends: 606 [2018-04-09 21:55:47,315 INFO L226 Difference]: Without dead ends: 539 [2018-04-09 21:55:47,315 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=356, Invalid=1049, Unknown=1, NotChecked=0, Total=1406 [2018-04-09 21:55:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-09 21:55:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 305. [2018-04-09 21:55:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-09 21:55:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 331 transitions. [2018-04-09 21:55:47,327 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 331 transitions. Word has length 93 [2018-04-09 21:55:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:47,327 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 331 transitions. [2018-04-09 21:55:47,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 21:55:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 331 transitions. [2018-04-09 21:55:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-09 21:55:47,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:47,328 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:47,328 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1455288304, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:47,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:47,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:47,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:47,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:47,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-09 21:55:47,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-09 21:55:47,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-09 21:55:47,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-04-09 21:55:47,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:55:47,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:55:47,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-09 21:55:47,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-09 21:55:47,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-04-09 21:55:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:47,515 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:47,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-09 21:55:47,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:55:47,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-09 21:55:47,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:55:47,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:24 [2018-04-09 21:55:47,617 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 33 treesize of output 27 [2018-04-09 21:55:47,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:47,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 21:55:47,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 21:55:47,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:55:47,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:47,648 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:47,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:55:47,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:55:47,672 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:33, output treesize:19 [2018-04-09 21:55:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:47,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-09 21:55:47,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2018-04-09 21:55:47,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 21:55:47,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 21:55:47,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:55:47,797 INFO L87 Difference]: Start difference. First operand 305 states and 331 transitions. Second operand 25 states. [2018-04-09 21:55:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:48,379 INFO L93 Difference]: Finished difference Result 463 states and 504 transitions. [2018-04-09 21:55:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:55:48,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 95 [2018-04-09 21:55:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:48,381 INFO L225 Difference]: With dead ends: 463 [2018-04-09 21:55:48,381 INFO L226 Difference]: Without dead ends: 461 [2018-04-09 21:55:48,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 21:55:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-09 21:55:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 315. [2018-04-09 21:55:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-09 21:55:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 342 transitions. [2018-04-09 21:55:48,394 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 342 transitions. Word has length 95 [2018-04-09 21:55:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:48,394 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 342 transitions. [2018-04-09 21:55:48,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 21:55:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 342 transitions. [2018-04-09 21:55:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-09 21:55:48,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:48,395 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:48,395 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1455288303, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:48,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:48,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:48,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:55:48,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:55:48,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 21:55:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-09 21:55:48,473 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:48,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-09 21:55:48,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-09 21:55:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-09 21:55:48,506 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:55:48,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:55:48,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:55:48,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:55:48,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:55:48,506 INFO L87 Difference]: Start difference. First operand 315 states and 342 transitions. Second operand 6 states. [2018-04-09 21:55:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:55:48,650 INFO L93 Difference]: Finished difference Result 315 states and 342 transitions. [2018-04-09 21:55:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:55:48,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-04-09 21:55:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:55:48,651 INFO L225 Difference]: With dead ends: 315 [2018-04-09 21:55:48,651 INFO L226 Difference]: Without dead ends: 314 [2018-04-09 21:55:48,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:55:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-09 21:55:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-04-09 21:55:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-09 21:55:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 340 transitions. [2018-04-09 21:55:48,664 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 340 transitions. Word has length 95 [2018-04-09 21:55:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:55:48,664 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 340 transitions. [2018-04-09 21:55:48,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:55:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 340 transitions. [2018-04-09 21:55:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-09 21:55:48,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:55:48,665 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:55:48,665 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 21:55:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1364019796, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:55:48,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:55:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:55:48,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:55:48,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-09 21:55:48,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2018-04-09 21:55:48,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:55:48,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-09 21:55:48,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:55:48,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:55:48,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-09 21:55:48,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-09 21:55:48,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:49 [2018-04-09 21:55:48,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-09 21:55:48,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:48,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-09 21:55:48,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:48,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-09 21:55:48,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:48,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:82 [2018-04-09 21:55:48,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-04-09 21:55:48,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:48,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:82 [2018-04-09 21:55:49,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:55:49,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:55:49,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-09 21:55:49,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-09 21:55:49,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:104, output treesize:96 [2018-04-09 21:55:49,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 125 [2018-04-09 21:55:49,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-09 21:55:49,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-09 21:55:49,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:55:49,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:142 [2018-04-09 21:55:49,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-09 21:55:49,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:55:49,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-09 21:55:49,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:151, output treesize:136 [2018-04-09 21:55:49,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 88 [2018-04-09 21:55:49,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:55:49,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 35 [2018-04-09 21:55:49,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-09 21:55:49,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:45 [2018-04-09 21:55:49,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:49,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-04-09 21:55:49,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:49,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:49,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-04-09 21:55:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:55:49,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:55:50,163 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 584 treesize of output 276 [2018-04-09 21:55:50,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:55:50,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:50,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 173 [2018-04-09 21:55:50,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-04-09 21:55:50,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 21:55:50,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-04-09 21:55:50,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:50,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:50,403 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 155 treesize of output 103 [2018-04-09 21:55:50,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:50,407 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:50,423 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:50,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 103 [2018-04-09 21:55:50,904 WARN L151 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 278 DAG size of output 198 [2018-04-09 21:55:50,908 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 78 treesize of output 79 [2018-04-09 21:55:50,908 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:50,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-04-09 21:55:50,912 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:50,915 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 58 treesize of output 59 [2018-04-09 21:55:50,915 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:51,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-04-09 21:55:51,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:51,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 58 [2018-04-09 21:55:51,498 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-09 21:55:51,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:51,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-04-09 21:55:51,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:51,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:55:51,754 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:51,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:51,764 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:51,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:51,772 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:51,777 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:52,039 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:52,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 69 [2018-04-09 21:55:52,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,112 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,128 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 3 case distinctions, treesize of input 51 treesize of output 60 [2018-04-09 21:55:52,130 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-09 21:55:52,273 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-04-09 21:55:52,284 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:52,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,419 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 3 case distinctions, treesize of input 48 treesize of output 57 [2018-04-09 21:55:52,420 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-09 21:55:52,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,588 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 3 case distinctions, treesize of input 45 treesize of output 54 [2018-04-09 21:55:52,590 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-09 21:55:52,747 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-04-09 21:55:52,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:52,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 58 [2018-04-09 21:55:52,781 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2018-04-09 21:55:52,791 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:52,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:52,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 59 [2018-04-09 21:55:52,874 INFO L267 ElimStorePlain]: Start of recursive call 26: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-09 21:55:53,014 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 12 xjuncts. [2018-04-09 21:55:53,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:55:53,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-04-09 21:55:53,023 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,023 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,046 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 3 case distinctions, treesize of input 37 treesize of output 57 [2018-04-09 21:55:53,048 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-09 21:55:53,125 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-09 21:55:53,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,805 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 56 treesize of output 49 [2018-04-09 21:55:53,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-04-09 21:55:53,829 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:53,859 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:53,862 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,863 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 62 treesize of output 53 [2018-04-09 21:55:53,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:53,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:55:53,887 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:53,923 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:54,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:54,619 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 56 treesize of output 47 [2018-04-09 21:55:54,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:54,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:55:54,640 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:54,671 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:55,312 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,314 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 59 treesize of output 52 [2018-04-09 21:55:55,317 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,317 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,320 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 33 treesize of output 25 [2018-04-09 21:55:55,321 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:55,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:55,333 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:55,339 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:55,341 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,343 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 48 [2018-04-09 21:55:55,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:55,345 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:55,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,358 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 31 treesize of output 31 [2018-04-09 21:55:55,359 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:55,369 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:55,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:55,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2018-04-09 21:55:55,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-04-09 21:55:55,961 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:55:55,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-09 21:55:55,991 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:56,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-09 21:55:56,014 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:56,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-09 21:55:56,016 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:56,038 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:56,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2018-04-09 21:55:56,048 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:56,087 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-09 21:55:56,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:56,653 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 49 treesize of output 44 [2018-04-09 21:55:56,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:56,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:55:56,657 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:56,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:56,667 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:56,671 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:56,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:56,675 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 46 [2018-04-09 21:55:56,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:56,677 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:56,687 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:56,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2018-04-09 21:55:56,697 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:55:56,719 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-09 21:55:57,266 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2018-04-09 21:55:57,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-04-09 21:55:57,328 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:57,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-04-09 21:55:57,360 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:57,395 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,395 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,399 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 48 treesize of output 37 [2018-04-09 21:55:57,399 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:57,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-09 21:55:57,420 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:57,436 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:55:57,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-09 21:55:57,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:57,443 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:57,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,455 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 31 treesize of output 31 [2018-04-09 21:55:57,456 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:57,464 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:57,466 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-09 21:55:57,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:57,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-09 21:55:57,481 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:57,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:55:57,490 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:57,495 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:55:58,013 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: 34 dim-0 vars, and 43 xjuncts. [2018-04-09 21:55:58,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 34 dim-0 vars, and 43 xjuncts. [2018-04-09 21:55:58,530 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:58,534 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 159 treesize of output 107 [2018-04-09 21:55:58,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:55:58,537 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:58,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:58,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 111 [2018-04-09 21:55:59,082 WARN L151 SmtUtils]: Spent 496ms on a formula simplification. DAG size of input: 308 DAG size of output 225 [2018-04-09 21:55:59,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-04-09 21:55:59,085 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:59,457 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 5 case distinctions, treesize of input 60 treesize of output 85 [2018-04-09 21:55:59,458 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 8 xjuncts. [2018-04-09 21:55:59,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:55:59,845 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 62 treesize of output 66 [2018-04-09 21:55:59,845 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-09 21:55:59,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-04-09 21:55:59,849 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:00,203 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:00,205 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 66 treesize of output 55 [2018-04-09 21:56:00,219 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:00,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 67 [2018-04-09 21:56:00,243 INFO L267 ElimStorePlain]: Start of recursive call 72: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:00,455 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-09 21:56:01,113 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:01,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2018-04-09 21:56:01,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:56:01,132 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:01,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:56:01,145 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:01,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:01,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:56:01,157 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:01,166 INFO L267 ElimStorePlain]: Start of recursive call 73: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:01,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:01,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-04-09 21:56:01,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:56:01,888 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:01,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2018-04-09 21:56:01,940 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:01,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:01,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-09 21:56:01,994 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:01,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:01,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-09 21:56:01,997 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,046 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-04-09 21:56:02,053 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,059 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 47 treesize of output 36 [2018-04-09 21:56:02,059 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,100 INFO L267 ElimStorePlain]: Start of recursive call 77: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-09 21:56:02,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-04-09 21:56:02,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:56:02,110 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:02,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,126 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 31 treesize of output 31 [2018-04-09 21:56:02,126 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,138 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:02,141 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-09 21:56:02,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-09 21:56:02,158 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:56:02,173 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:02,181 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:02,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,905 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 69 treesize of output 60 [2018-04-09 21:56:02,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,910 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 33 treesize of output 25 [2018-04-09 21:56:02,911 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:56:02,928 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:02,938 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:02,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,942 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 63 treesize of output 56 [2018-04-09 21:56:02,944 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,944 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:02,947 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 31 treesize of output 31 [2018-04-09 21:56:02,948 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:02,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:56:02,971 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-04-09 21:56:02,981 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:03,861 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:03,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:56:03,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 77 [2018-04-09 21:56:03,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-04-09 21:56:03,959 INFO L267 ElimStorePlain]: Start of recursive call 97: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:04,390 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:04,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:04,423 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 7 case distinctions, treesize of input 51 treesize of output 99 [2018-04-09 21:56:04,424 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:56:04,449 INFO L267 ElimStorePlain]: Start of recursive call 98: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:56:06,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:06,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, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 99 [2018-04-09 21:56:06,127 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:56:06,142 INFO L267 ElimStorePlain]: Start of recursive call 99: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:56:08,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:08,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:08,140 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 7 case distinctions, treesize of input 48 treesize of output 96 [2018-04-09 21:56:08,141 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:56:08,159 INFO L267 ElimStorePlain]: Start of recursive call 100: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:56:10,288 INFO L267 ElimStorePlain]: Start of recursive call 96: 4 dim-1 vars, End of recursive call: 32 dim-0 vars, and 54 xjuncts. [2018-04-09 21:56:10,292 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:10,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:56:10,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2018-04-09 21:56:10,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:10,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:10,313 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:10,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:10,349 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 7 case distinctions, treesize of input 45 treesize of output 99 [2018-04-09 21:56:10,349 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:56:10,368 INFO L267 ElimStorePlain]: Start of recursive call 102: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 80 xjuncts. [2018-04-09 21:56:11,663 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, End of recursive call: 32 dim-0 vars, and 44 xjuncts. [2018-04-09 21:56:11,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:11,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:56:11,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2018-04-09 21:56:11,710 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:11,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:11,747 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 104 [2018-04-09 21:56:11,747 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-09 21:56:11,781 INFO L267 ElimStorePlain]: Start of recursive call 104: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-09 21:56:14,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:14,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 73 [2018-04-09 21:56:14,211 INFO L267 ElimStorePlain]: Start of recursive call 105: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:15,127 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-1 vars, End of recursive call: 18 dim-0 vars, and 49 xjuncts. [2018-04-09 21:56:21,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:21,761 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 66 treesize of output 57 [2018-04-09 21:56:21,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:21,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 70 [2018-04-09 21:56:21,800 INFO L267 ElimStorePlain]: Start of recursive call 107: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:22,011 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-09 21:56:22,013 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:22,014 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 72 treesize of output 61 [2018-04-09 21:56:22,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:22,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 67 [2018-04-09 21:56:22,058 INFO L267 ElimStorePlain]: Start of recursive call 109: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:22,275 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-09 21:56:28,912 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:28,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2018-04-09 21:56:28,963 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-04-09 21:56:28,964 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-09 21:56:29,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 44 [2018-04-09 21:56:29,043 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,110 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:29,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 70 [2018-04-09 21:56:29,134 INFO L267 ElimStorePlain]: Start of recursive call 113: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:29,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-09 21:56:29,343 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-09 21:56:29,344 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-09 21:56:29,346 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-04-09 21:56:29,347 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:56:29,349 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:29,479 INFO L267 ElimStorePlain]: Start of recursive call 110: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 15 xjuncts. [2018-04-09 21:56:36,033 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-09 21:56:36,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:56:36,036 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:36,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-09 21:56:36,053 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:36,070 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:36,071 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-09 21:56:36,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:56:36,075 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:36,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,086 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-04-09 21:56:36,095 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:36,111 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:56:36,113 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,114 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 63 treesize of output 54 [2018-04-09 21:56:36,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 67 [2018-04-09 21:56:36,143 INFO L267 ElimStorePlain]: Start of recursive call 126: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:56:36,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:56:36,277 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:36,354 INFO L267 ElimStorePlain]: Start of recursive call 125: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-04-09 21:56:36,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,357 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 59 treesize of output 54 [2018-04-09 21:56:36,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:56:36,359 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-09 21:56:36,369 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:56:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:56:36,371 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:36,378 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:56:43,093 INFO L267 ElimStorePlain]: Start of recursive call 66: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: 129 dim-0 vars, and 163 xjuncts. [2018-04-09 21:56:49,778 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 129 dim-0 vars, and 162 xjuncts. [2018-04-09 21:57:01,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:01,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 121 [2018-04-09 21:57:01,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-04-09 21:57:01,381 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:01,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 127 [2018-04-09 21:57:01,455 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 4 xjuncts. [2018-04-09 21:57:01,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:01,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 134 [2018-04-09 21:57:01,607 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:57:04,193 WARN L151 SmtUtils]: Spent 2565ms on a formula simplification. DAG size of input: 888 DAG size of output 580 [2018-04-09 21:57:04,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-09 21:57:04,198 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:04,200 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 94 treesize of output 95 [2018-04-09 21:57:04,201 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:04,204 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 74 treesize of output 75 [2018-04-09 21:57:04,204 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:05,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-09 21:57:05,867 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:07,249 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 93 [2018-04-09 21:57:07,250 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 4 xjuncts. [2018-04-09 21:57:08,898 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 5 case distinctions, treesize of input 64 treesize of output 89 [2018-04-09 21:57:08,899 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 8 xjuncts. [2018-04-09 21:57:10,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-04-09 21:57:10,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:57:10,828 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:57:10,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:57:10,848 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 2 xjuncts. [2018-04-09 21:57:10,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:10,861 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:10,871 INFO L267 ElimStorePlain]: Start of recursive call 141: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:57:10,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-09 21:57:10,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:10,878 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:10,893 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:57:10,894 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:57:10,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:10,907 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:10,914 INFO L267 ElimStorePlain]: Start of recursive call 145: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:57:10,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-04-09 21:57:10,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:10,921 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:10,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:10,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2018-04-09 21:57:10,947 INFO L267 ElimStorePlain]: Start of recursive call 151: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:57:10,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:57:10,980 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 2 xjuncts. [2018-04-09 21:57:10,999 INFO L267 ElimStorePlain]: Start of recursive call 149: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-04-09 21:57:11,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:11,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-04-09 21:57:11,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:11,008 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:11,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:11,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2018-04-09 21:57:11,036 INFO L267 ElimStorePlain]: Start of recursive call 155: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:57:11,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:57:11,063 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-04-09 21:57:11,080 INFO L267 ElimStorePlain]: Start of recursive call 153: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-09 21:57:12,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:12,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:12,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:12,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 86 [2018-04-09 21:57:13,024 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:13,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:13,061 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 110 [2018-04-09 21:57:13,062 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-09 21:57:13,097 INFO L267 ElimStorePlain]: Start of recursive call 158: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-09 21:57:15,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:15,833 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:15,870 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 107 [2018-04-09 21:57:15,871 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-09 21:57:15,906 INFO L267 ElimStorePlain]: Start of recursive call 159: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-09 21:57:20,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:20,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 79 [2018-04-09 21:57:20,245 INFO L267 ElimStorePlain]: Start of recursive call 160: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:57:22,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:22,457 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:22,495 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 104 [2018-04-09 21:57:22,495 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-09 21:57:22,529 INFO L267 ElimStorePlain]: Start of recursive call 161: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-09 21:57:27,386 INFO L267 ElimStorePlain]: Start of recursive call 157: 4 dim-1 vars, End of recursive call: 38 dim-0 vars, and 69 xjuncts. [2018-04-09 21:57:27,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:27,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:27,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:27,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 97 [2018-04-09 21:57:27,555 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 166 [2018-04-09 21:57:27,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:27,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:27,606 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 7 case distinctions, treesize of input 65 treesize of output 108 [2018-04-09 21:57:27,606 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:27,623 INFO L267 ElimStorePlain]: Start of recursive call 163: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:29,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:29,112 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:29,147 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 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-09 21:57:29,147 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:29,162 INFO L267 ElimStorePlain]: Start of recursive call 164: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:30,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:30,980 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:31,012 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 7 case distinctions, treesize of input 62 treesize of output 105 [2018-04-09 21:57:31,012 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:31,029 INFO L267 ElimStorePlain]: Start of recursive call 165: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:33,170 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:33,172 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:33,202 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 7 case distinctions, treesize of input 56 treesize of output 99 [2018-04-09 21:57:33,202 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:33,219 INFO L267 ElimStorePlain]: Start of recursive call 166: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:35,705 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:35,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 85 [2018-04-09 21:57:35,731 INFO L267 ElimStorePlain]: Start of recursive call 167: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:57:37,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:37,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:37,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-09 21:57:37,853 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:37,868 INFO L267 ElimStorePlain]: Start of recursive call 168: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:41,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:41,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:41,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 7 case distinctions, treesize of input 62 treesize of output 105 [2018-04-09 21:57:41,459 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:41,475 INFO L267 ElimStorePlain]: Start of recursive call 169: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:45,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:45,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:45,621 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 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-09 21:57:45,621 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:45,637 INFO L267 ElimStorePlain]: Start of recursive call 170: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-09 21:57:50,139 INFO L267 ElimStorePlain]: Start of recursive call 162: 8 dim-1 vars, End of recursive call: 64 dim-0 vars, and 86 xjuncts. [2018-04-09 21:57:50,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:50,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:50,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:57:50,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-04-09 21:57:50,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:50,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:50,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:50,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:57:50,184 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 7 case distinctions, treesize of input 45 treesize of output 99 [2018-04-09 21:57:50,184 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:57:50,196 INFO L267 ElimStorePlain]: Start of recursive call 172: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 80 xjuncts. [2018-04-09 21:57:51,490 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, End of recursive call: 32 dim-0 vars, and 44 xjuncts. [2018-04-09 21:58:12,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:12,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 69 [2018-04-09 21:58:12,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-04-09 21:58:12,107 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:12,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 46 treesize of output 40 [2018-04-09 21:58:12,131 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:12,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:12,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 74 [2018-04-09 21:58:12,179 INFO L267 ElimStorePlain]: Start of recursive call 176: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:58:12,361 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2018-04-09 21:58:12,362 INFO L267 ElimStorePlain]: Start of recursive call 177: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-09 21:58:12,519 INFO L267 ElimStorePlain]: Start of recursive call 173: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 15 xjuncts. [2018-04-09 21:58:33,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:33,932 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 67 treesize of output 58 [2018-04-09 21:58:33,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:33,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 67 [2018-04-09 21:58:33,960 INFO L267 ElimStorePlain]: Start of recursive call 179: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-09 21:58:34,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:58:34,094 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:34,179 INFO L267 ElimStorePlain]: Start of recursive call 178: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-04-09 21:58:34,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,183 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 68 treesize of output 61 [2018-04-09 21:58:34,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:58:34,185 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:34,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-09 21:58:34,205 INFO L267 ElimStorePlain]: Start of recursive call 183: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:58:34,225 INFO L267 ElimStorePlain]: Start of recursive call 181: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:58:34,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,228 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 68 treesize of output 61 [2018-04-09 21:58:34,230 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-04-09 21:58:34,238 INFO L267 ElimStorePlain]: Start of recursive call 185: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:58:34,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:58:34,260 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:34,272 INFO L267 ElimStorePlain]: Start of recursive call 184: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:58:34,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,276 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 63 treesize of output 58 [2018-04-09 21:58:34,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:34,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-09 21:58:34,279 INFO L267 ElimStorePlain]: Start of recursive call 188: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:34,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:58:34,292 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:34,300 INFO L267 ElimStorePlain]: Start of recursive call 187: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 72 [2018-04-09 21:58:56,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-04-09 21:58:56,095 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-09 21:58:56,127 INFO L267 ElimStorePlain]: Start of recursive call 192: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2018-04-09 21:58:56,157 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 2 xjuncts. [2018-04-09 21:58:56,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-09 21:58:56,186 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:56,214 INFO L267 ElimStorePlain]: Start of recursive call 190: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:58:56,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2018-04-09 21:58:56,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 56 treesize of output 48 [2018-04-09 21:58:56,227 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:56,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,257 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 56 treesize of output 56 [2018-04-09 21:58:56,258 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,287 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 45 treesize of output 45 [2018-04-09 21:58:56,287 INFO L267 ElimStorePlain]: Start of recursive call 198: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-04-09 21:58:56,316 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 2 xjuncts. [2018-04-09 21:58:56,341 INFO L267 ElimStorePlain]: Start of recursive call 195: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:58:56,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 83 [2018-04-09 21:58:56,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2018-04-09 21:58:56,441 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 2 xjuncts. [2018-04-09 21:58:56,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:58:56,536 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 59 treesize of output 48 [2018-04-09 21:58:56,537 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:58:56,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 38 treesize of output 30 [2018-04-09 21:58:56,619 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-04-09 21:58:56,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2018-04-09 21:58:56,704 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 2 xjuncts. Received shutdown request... [2018-04-09 21:58:56,782 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 21:58:56,782 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:58:56,787 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:58:56,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:58:56 BoogieIcfgContainer [2018-04-09 21:58:56,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:58:56,788 INFO L168 Benchmark]: Toolchain (without parser) took 251780.54 ms. Allocated memory was 305.1 MB in the beginning and 385.4 MB in the end (delta: 80.2 MB). Free memory was 240.1 MB in the beginning and 313.0 MB in the end (delta: -73.0 MB). Peak memory consumption was 393.5 MB. Max. memory is 5.3 GB. [2018-04-09 21:58:56,789 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:58:56,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.06 ms. Allocated memory is still 305.1 MB. Free memory was 240.1 MB in the beginning and 214.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-09 21:58:56,789 INFO L168 Benchmark]: Boogie Preprocessor took 63.14 ms. Allocated memory is still 305.1 MB. Free memory was 214.0 MB in the beginning and 211.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:58:56,790 INFO L168 Benchmark]: RCFGBuilder took 784.60 ms. Allocated memory was 305.1 MB in the beginning and 468.7 MB in the end (delta: 163.6 MB). Free memory was 211.0 MB in the beginning and 379.3 MB in the end (delta: -168.3 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. [2018-04-09 21:58:56,790 INFO L168 Benchmark]: TraceAbstraction took 250578.91 ms. Allocated memory was 468.7 MB in the beginning and 385.4 MB in the end (delta: -83.4 MB). Free memory was 379.3 MB in the beginning and 313.0 MB in the end (delta: 66.2 MB). Peak memory consumption was 369.1 MB. Max. memory is 5.3 GB. [2018-04-09 21:58:56,791 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.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 349.06 ms. Allocated memory is still 305.1 MB. Free memory was 240.1 MB in the beginning and 214.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 63.14 ms. Allocated memory is still 305.1 MB. Free memory was 214.0 MB in the beginning and 211.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 784.60 ms. Allocated memory was 305.1 MB in the beginning and 468.7 MB in the end (delta: 163.6 MB). Free memory was 211.0 MB in the beginning and 379.3 MB in the end (delta: -168.3 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 250578.91 ms. Allocated memory was 468.7 MB in the beginning and 385.4 MB in the end (delta: -83.4 MB). Free memory was 379.3 MB in the beginning and 313.0 MB in the end (delta: 66.2 MB). Peak memory consumption was 369.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 201 locations, 67 error locations. TIMEOUT Result, 250.5s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 46.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5593 SDtfs, 15871 SDslu, 28972 SDs, 0 SdLazy, 13863 SolverSat, 1013 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3802 GetRequests, 3118 SyntacticMatches, 28 SemanticMatches, 656 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6145 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 3970 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1735 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3410 ConstructedInterpolants, 280 QuantifiedInterpolants, 2217597 SizeOfPredicates, 277 NumberOfNonLiveVariables, 4963 ConjunctsInSsa, 475 ConjunctsInUnsatCore, 60 InterpolantComputations, 43 PerfectInterpolantSequences, 499/642 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-58-56-800.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-58-56-800.csv Completed graceful shutdown