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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 23:56:05,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 23:56:05,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 23:56:05,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 23:56:05,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 23:56:05,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 23:56:05,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 23:56:05,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 23:56:05,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 23:56:05,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 23:56:05,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 23:56:05,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 23:56:05,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 23:56:05,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 23:56:05,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 23:56:05,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 23:56:05,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 23:56:05,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 23:56:05,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 23:56:05,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 23:56:05,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 23:56:05,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 23:56:05,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 23:56:05,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 23:56:05,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 23:56:05,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 23:56:05,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 23:56:05,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 23:56:05,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 23:56:05,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 23:56:05,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 23:56:05,241 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 23:56:05,265 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 23:56:05,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 23:56:05,266 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 23:56:05,266 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 23:56:05,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 23:56:05,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 23:56:05,267 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 23:56:05,267 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 23:56:05,267 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 23:56:05,267 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 23:56:05,268 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 23:56:05,268 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 23:56:05,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 23:56:05,268 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 23:56:05,268 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 23:56:05,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 23:56:05,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 23:56:05,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 23:56:05,269 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 23:56:05,269 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 23:56:05,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 23:56:05,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 23:56:05,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 23:56:05,270 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 23:56:05,270 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 23:56:05,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 23:56:05,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 23:56:05,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 23:56:05,271 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 23:56:05,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 23:56:05,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 23:56:05,272 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 23:56:05,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:56:05,272 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 23:56:05,273 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 23:56:05,273 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 23:56:05,273 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 23:56:05,274 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 23:56:05,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 23:56:05,315 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 23:56:05,317 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 23:56:05,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 23:56:05,319 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 23:56:05,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,636 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ca43e5cd [2018-04-06 23:56:05,807 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 23:56:05,807 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 23:56:05,807 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,819 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 23:56:05,819 INFO L215 ultiparseSymbolTable]: [2018-04-06 23:56:05,819 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 23:56:05,819 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 23:56:05,820 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,820 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,821 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,822 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,823 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,825 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,826 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,827 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,828 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,829 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,830 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,831 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,832 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,832 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-06 23:56:05,847 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ca43e5cd [2018-04-06 23:56:05,852 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 23:56:05,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-06 23:56:05,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 23:56:05,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 23:56:05,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 23:56:05,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:56:05" (1/1) ... [2018-04-06 23:56:05,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1472025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:05, skipping insertion in model container [2018-04-06 23:56:05,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:56:05" (1/1) ... [2018-04-06 23:56:05,875 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 23:56:05,904 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 23:56:06,064 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 23:56:06,115 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 23:56:06,123 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 23:56:06,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06 WrapperNode [2018-04-06 23:56:06,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 23:56:06,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 23:56:06,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 23:56:06,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 23:56:06,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 23:56:06,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 23:56:06,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 23:56:06,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 23:56:06,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 23:56:06,330 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 23:56:06,330 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 23:56:06,330 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 23:56:06,330 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 23:56:06,330 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-06 23:56:06,331 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 23:56:06,331 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 23:56:06,331 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 23:56:06,331 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 23:56:06,331 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 23:56:06,331 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 23:56:06,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 23:56:06,333 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 23:56:06,334 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 23:56:06,335 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 23:56:06,336 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 23:56:06,337 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 23:56:06,338 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 23:56:06,339 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 23:56:06,340 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 23:56:06,341 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 23:56:06,342 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 23:56:06,343 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 23:56:06,344 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 23:56:06,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 23:56:06,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 23:56:06,346 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 23:56:06,744 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 23:56:06,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:56:06 BoogieIcfgContainer [2018-04-06 23:56:06,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 23:56:06,745 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-06 23:56:06,745 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-06 23:56:06,746 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-06 23:56:06,748 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:56:06" (1/1) ... [2018-04-06 23:56:06,754 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-06 23:56:06,754 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-06 23:56:06,768 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-06 23:56:06,789 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 23:56:06,805 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 4 location literals (each corresponds to one heap write) [2018-04-06 23:56:06,815 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 23:56:06,830 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-06 23:56:06,831 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: (Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2) : mll_L566_0 (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2) : |mll_L566'_3| (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) : |mll_L566'_2| (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) : mll_L566_1 [2018-04-06 23:56:06,833 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: (SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') : (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1)) : (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) (SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') : v_main_~nondetString2~0.base_2 : (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2) (SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) : v_main_~nondetString1~0.base_2 : (Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2) (SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) : (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)) : (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:56:06,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-06 23:59:46,356 INFO L314 AbstractInterpreter]: Visited 100 different actions 793 times. Merged at 72 different actions 477 times. Widened at 1 different actions 1 times. Found 43 fixpoints after 12 different actions. Largest state had 47 variables. [2018-04-06 23:59:46,358 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-06 23:59:46,366 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-04-06 23:59:46,366 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-06 23:59:46,367 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-06 23:59:46,367 INFO L437 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_2| v_main_~nondetString1~0.base_2), at (SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566)) ((select |v_#memory_int_4| v_main_~nondetString2~0.base_2), at (SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566')) ((select (select |v_#memory_int_8| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2), at (SUMMARY for call #t~mem5 := read~int(~ps2~0.base, ~ps2~0.offset, 1); srcloc: L546'''')) ((select (select |v_#memory_int_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2), at (SUMMARY for call #t~mem2 := read~int(~ps~0.base, ~ps~0.offset, 1); srcloc: L543)) ((select (select |v_#memory_int_7| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4), at (SUMMARY for call #t~mem4 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546''')) ((select (select |v_#memory_int_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2), at (SUMMARY for call #t~mem3 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546)) ((select (select |v_#memory_int_9| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8), at (SUMMARY for call #t~mem9 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546'''''''''''''''''')) [2018-04-06 23:59:46,441 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,441 DEBUG L264 HeapPartitionManager]: (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2) [2018-04-06 23:59:46,441 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,442 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2) [2018-04-06 23:59:46,442 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-06 23:59:46,442 DEBUG L268 HeapPartitionManager]: at array read ((select |v_#memory_int_4| v_main_~nondetString2~0.base_2), at (SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566')). [2018-04-06 23:59:46,490 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,490 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:59:46,525 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,525 DEBUG L266 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) [2018-04-06 23:59:46,525 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-06 23:59:46,525 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_8| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2), at (SUMMARY for call #t~mem5 := read~int(~ps2~0.base, ~ps2~0.offset, 1); srcloc: L546'''')). [2018-04-06 23:59:46,568 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,568 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:59:46,568 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,568 DEBUG L266 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) [2018-04-06 23:59:46,568 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-06 23:59:46,568 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2), at (SUMMARY for call #t~mem2 := read~int(~ps~0.base, ~ps~0.offset, 1); srcloc: L543)). [2018-04-06 23:59:46,653 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,653 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:59:46,653 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,653 DEBUG L266 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) [2018-04-06 23:59:46,653 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-06 23:59:46,654 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_7| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4), at (SUMMARY for call #t~mem4 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546''')). [2018-04-06 23:59:46,686 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,686 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:59:46,686 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,687 DEBUG L266 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) [2018-04-06 23:59:46,687 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-06 23:59:46,687 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2), at (SUMMARY for call #t~mem3 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546)). [2018-04-06 23:59:46,743 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-06 23:59:46,744 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1))) [2018-04-06 23:59:46,744 DEBUG L265 HeapPartitionManager]: and [2018-04-06 23:59:46,744 DEBUG L266 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))) [2018-04-06 23:59:46,744 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-06 23:59:46,744 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_9| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8), at (SUMMARY for call #t~mem9 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546'''''''''''''''''')). [2018-04-06 23:59:46,745 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-06 23:59:46,745 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-06 23:59:46,745 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-06 23:59:46,745 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_2| v_main_~nondetString1~0.base_2), at (SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566)) [2018-04-06 23:59:46,745 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-06 23:59:46,745 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_65 [2018-04-06 23:59:46,745 DEBUG L374 HeapPartitionManager]: with contents [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,745 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,745 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_4| v_main_~nondetString2~0.base_2), at (SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566')) [2018-04-06 23:59:46,745 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,746 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,746 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_8| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2), at (SUMMARY for call #t~mem5 := read~int(~ps2~0.base, ~ps2~0.offset, 1); srcloc: L546'''')) [2018-04-06 23:59:46,746 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,746 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_65 [2018-04-06 23:59:46,746 DEBUG L374 HeapPartitionManager]: with contents [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,746 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,746 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_8| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2), at (SUMMARY for call #t~mem5 := read~int(~ps2~0.base, ~ps2~0.offset, 1); srcloc: L546'''')) [2018-04-06 23:59:46,746 DEBUG L325 HeapPartitionManager]: write locations: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,746 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,746 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2), at (SUMMARY for call #t~mem2 := read~int(~ps~0.base, ~ps~0.offset, 1); srcloc: L543)) [2018-04-06 23:59:46,746 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,746 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,747 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2), at (SUMMARY for call #t~mem2 := read~int(~ps~0.base, ~ps~0.offset, 1); srcloc: L543)) [2018-04-06 23:59:46,747 DEBUG L325 HeapPartitionManager]: write locations: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,747 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,747 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_7| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4), at (SUMMARY for call #t~mem4 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546''')) [2018-04-06 23:59:46,747 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,747 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,747 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_7| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4), at (SUMMARY for call #t~mem4 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546''')) [2018-04-06 23:59:46,747 DEBUG L325 HeapPartitionManager]: write locations: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,747 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,747 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2), at (SUMMARY for call #t~mem3 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546)) [2018-04-06 23:59:46,747 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,747 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,747 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2), at (SUMMARY for call #t~mem3 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546)) [2018-04-06 23:59:46,748 DEBUG L325 HeapPartitionManager]: write locations: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,748 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,748 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_9| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8), at (SUMMARY for call #t~mem9 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546'''''''''''''''''')) [2018-04-06 23:59:46,748 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,748 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_65 [2018-04-06 23:59:46,748 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_9| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8), at (SUMMARY for call #t~mem9 := read~int(~pt~0.base, ~pt~0.offset, 1); srcloc: L546'''''''''''''''''')) [2018-04-06 23:59:46,748 DEBUG L325 HeapPartitionManager]: write locations: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,748 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-06 23:59:46,748 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-06 23:59:46,748 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-06 23:59:46,748 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-04-06 23:59:46,749 INFO L346 HeapPartitionManager]: # location blocks :2 [2018-04-06 23:59:46,749 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-06 23:59:46,749 DEBUG L356 HeapPartitionManager]: [(Store [1] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with v_main_~nondetString1~0.base_2), (Store [2] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with v_main_~nondetString2~0.base_2)] [2018-04-06 23:59:46,749 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-06 23:59:46,749 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-06 23:59:46,749 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-04-06 23:59:46,749 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-06 23:59:46,749 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-06 23:59:46,749 DEBUG L356 HeapPartitionManager]: [(Store [3] at(SUMMARY for call write~int(0, ~nondetString2~0.base, ~nondetString2~0.offset + (~length2~0 - 1) * 1, 1); srcloc: L566') with (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1))), (Store [0] at(SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1) * 1, 1); srcloc: L566) with (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)))] [2018-04-06 23:59:46,750 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-06 23:59:46,753 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,753 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,753 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,753 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,753 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,753 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,753 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,753 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,754 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,754 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-06 23:59:46,754 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,754 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,754 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,754 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,754 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,754 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,755 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,755 DEBUG L281 ransitionTransformer]: Formula: (and (<= 0 (+ |v_main_#t~nondet11_1| 2147483648)) (<= |v_main_#t~nondet11_1| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_1|} OutVars{main_#t~nondet11=|v_main_#t~nondet11_1|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,755 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,755 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,755 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,755 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_1| (store |v_#valid_2| 0 0)) InVars {#valid=|v_#valid_2|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid] [2018-04-06 23:59:46,755 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,755 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,756 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,756 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~length1~0_1 |v_main_#t~nondet11_2|) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_#t~nondet11=|v_main_#t~nondet11_2|, main_~length1~0=v_main_~length1~0_1} AuxVars[] AssignedVars[main_~length1~0] [2018-04-06 23:59:46,756 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,756 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,756 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,756 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,756 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,756 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,756 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,756 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~nondet11=|v_main_#t~nondet11_3|} AuxVars[] AssignedVars[main_#t~nondet11] [2018-04-06 23:59:46,756 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,757 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,757 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,757 DEBUG L281 ransitionTransformer]: Formula: (and (<= |v_main_#t~nondet12_1| 2147483647) (<= 0 (+ |v_main_#t~nondet12_1| 2147483648))) InVars {main_#t~nondet12=|v_main_#t~nondet12_1|} OutVars{main_#t~nondet12=|v_main_#t~nondet12_1|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,757 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,757 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,757 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,757 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~length2~0_1 |v_main_#t~nondet12_2|) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_#t~nondet12=|v_main_#t~nondet12_2|, main_~length2~0=v_main_~length2~0_1} AuxVars[] AssignedVars[main_~length2~0] [2018-04-06 23:59:46,757 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,758 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,758 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,758 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~nondet12=|v_main_#t~nondet12_3|} AuxVars[] AssignedVars[main_#t~nondet12] [2018-04-06 23:59:46,758 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,758 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,758 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,758 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~length1~0_2 1) InVars {main_~length1~0=v_main_~length1~0_2} OutVars{main_~length1~0=v_main_~length1~0_2} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,758 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,758 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,759 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,759 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~length1~0_4 1)) InVars {main_~length1~0=v_main_~length1~0_4} OutVars{main_~length1~0=v_main_~length1~0_4} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,759 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,759 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,759 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,759 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~length1~0_3 1) InVars {} OutVars{main_~length1~0=v_main_~length1~0_3} AuxVars[] AssignedVars[main_~length1~0] [2018-04-06 23:59:46,759 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,759 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,759 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,760 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~length2~0_2 1) InVars {main_~length2~0=v_main_~length2~0_2} OutVars{main_~length2~0=v_main_~length2~0_2} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,760 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,760 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,760 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,760 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~length2~0_4 1)) InVars {main_~length2~0=v_main_~length2~0_4} OutVars{main_~length2~0=v_main_~length2~0_4} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,760 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,760 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,760 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,760 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~length2~0_3 1) InVars {} OutVars{main_~length2~0=v_main_~length2~0_3} AuxVars[] AssignedVars[main_~length2~0] [2018-04-06 23:59:46,760 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,760 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,761 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,761 DEBUG L281 ransitionTransformer]: Formula: (and (= 0 |v_main_#t~malloc13.offset_1|) (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc13.base_1| 1)) (= 0 (select |v_#valid_4| |v_main_#t~malloc13.base_1|)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc13.base_1| v_main_~length1~0_5)) (not (= 0 |v_main_#t~malloc13.base_1|))) InVars {main_~length1~0=v_main_~length1~0_5, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{main_#t~malloc13.base=|v_main_#t~malloc13.base_1|, main_~length1~0=v_main_~length1~0_5, main_#t~malloc13.offset=|v_main_#t~malloc13.offset_1|, #length=|v_#length_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, main_#t~malloc13.base, main_#t~malloc13.offset, #length] [2018-04-06 23:59:46,761 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,761 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,761 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,761 DEBUG L281 ransitionTransformer]: Formula: (and (= v_main_~nondetString1~0.base_1 |v_main_#t~malloc13.base_2|) (= v_main_~nondetString1~0.offset_1 |v_main_#t~malloc13.offset_2|)) InVars {main_#t~malloc13.base=|v_main_#t~malloc13.base_2|, main_#t~malloc13.offset=|v_main_#t~malloc13.offset_2|} OutVars{main_#t~malloc13.base=|v_main_#t~malloc13.base_2|, main_#t~malloc13.offset=|v_main_#t~malloc13.offset_2|, main_~nondetString1~0.base=v_main_~nondetString1~0.base_1, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_1} AuxVars[] AssignedVars[main_~nondetString1~0.base, main_~nondetString1~0.offset] [2018-04-06 23:59:46,761 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,761 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,762 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,762 DEBUG L281 ransitionTransformer]: Formula: (and (not (= |v_main_#t~malloc14.base_1| 0)) (= 0 |v_main_#t~malloc14.offset_1|) (= (select |v_#valid_6| |v_main_#t~malloc14.base_1|) 0) (= |v_#length_3| (store |v_#length_4| |v_main_#t~malloc14.base_1| v_main_~length2~0_5)) (= |v_#valid_5| (store |v_#valid_6| |v_main_#t~malloc14.base_1| 1))) InVars {#length=|v_#length_4|, main_~length2~0=v_main_~length2~0_5, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, main_#t~malloc14.offset=|v_main_#t~malloc14.offset_1|, main_~length2~0=v_main_~length2~0_5, main_#t~malloc14.base=|v_main_#t~malloc14.base_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc14.offset, main_#t~malloc14.base] [2018-04-06 23:59:46,762 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,762 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,762 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,762 DEBUG L281 ransitionTransformer]: Formula: (and (= v_main_~nondetString2~0.base_1 |v_main_#t~malloc14.base_2|) (= v_main_~nondetString2~0.offset_1 |v_main_#t~malloc14.offset_2|)) InVars {main_#t~malloc14.offset=|v_main_#t~malloc14.offset_2|, main_#t~malloc14.base=|v_main_#t~malloc14.base_2|} OutVars{main_#t~malloc14.offset=|v_main_#t~malloc14.offset_2|, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_1, main_#t~malloc14.base=|v_main_#t~malloc14.base_2|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_1} AuxVars[] AssignedVars[main_~nondetString2~0.offset, main_~nondetString2~0.base] [2018-04-06 23:59:46,762 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,762 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,765 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,765 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6))) (and (= 1 (select |v_#valid_7| v_main_~nondetString1~0.base_2)) (and (= |v_#memory_int_part_locs_30_locs_65_2| |v_#memory_int_part_locs_30_locs_65_1|) (= |v_#memory_int_part_locs_65_locs_65_1| (store |v_#memory_int_part_locs_65_locs_65_2| v_main_~nondetString1~0.base_2 (store (select |v_#memory_int_part_locs_30_locs_65_1| v_main_~nondetString1~0.base_2) (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)) 0)))) (<= .cse0 (select |v_#length_5| v_main_~nondetString1~0.base_2)) (<= 1 .cse0))) InVars {main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #length=|v_#length_5|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_2|, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_1|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} OutVars{main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #length=|v_#length_5|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_1|, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_2|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} AuxVars[] AssignedVars[#memory_int_part_locs_65_locs_65, #memory_int_part_locs_30_locs_65] [2018-04-06 23:59:46,766 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,766 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,766 DEBUG L290 ransitionTransformer]: (let ((.cse0 (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6))) (and (= 1 (select |v_#valid_7| v_main_~nondetString1~0.base_2)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_main_~nondetString1~0.base_2 (store (select |v_#memory_int_2| v_main_~nondetString1~0.base_2) (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)) 0))) (<= .cse0 (select |v_#length_5| v_main_~nondetString1~0.base_2)) (<= 1 .cse0))) [2018-04-06 23:59:46,766 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,766 DEBUG L292 ransitionTransformer]: (let ((.cse0 (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6))) (and (= 1 (select |v_#valid_7| v_main_~nondetString1~0.base_2)) (and (= |v_#memory_int_part_locs_30_locs_65_2| |v_#memory_int_part_locs_30_locs_65_1|) (= |v_#memory_int_part_locs_65_locs_65_1| (store |v_#memory_int_part_locs_65_locs_65_2| v_main_~nondetString1~0.base_2 (store (select |v_#memory_int_part_locs_30_locs_65_1| v_main_~nondetString1~0.base_2) (+ v_main_~nondetString1~0.offset_2 v_main_~length1~0_6 (- 1)) 0)))) (<= .cse0 (select |v_#length_5| v_main_~nondetString1~0.base_2)) (<= 1 .cse0))) [2018-04-06 23:59:46,766 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,766 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,766 DEBUG L298 ransitionTransformer]: {main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} [2018-04-06 23:59:46,766 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,766 DEBUG L300 ransitionTransformer]: {main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #length=|v_#length_5|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_2|, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_1|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} [2018-04-06 23:59:46,767 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,767 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,767 DEBUG L306 ransitionTransformer]: {main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} [2018-04-06 23:59:46,767 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,767 DEBUG L308 ransitionTransformer]: {main_~length1~0=v_main_~length1~0_6, main_~nondetString1~0.base=v_main_~nondetString1~0.base_2, #valid=|v_#valid_7|, #length=|v_#length_5|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_1|, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_2|, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_2} [2018-04-06 23:59:46,767 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,767 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,767 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_8| v_main_~nondetString1~0.base_3) 1)) InVars {main_~nondetString1~0.base=v_main_~nondetString1~0.base_3, #valid=|v_#valid_8|} OutVars{main_~nondetString1~0.base=v_main_~nondetString1~0.base_3, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,767 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,767 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,768 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,768 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ v_main_~length1~0_7 v_main_~nondetString1~0.offset_3))) (or (not (<= .cse0 (select |v_#length_6| v_main_~nondetString1~0.base_4))) (not (<= 1 .cse0)))) InVars {main_~length1~0=v_main_~length1~0_7, #length=|v_#length_6|, main_~nondetString1~0.base=v_main_~nondetString1~0.base_4, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_3} OutVars{main_~length1~0=v_main_~length1~0_7, #length=|v_#length_6|, main_~nondetString1~0.base=v_main_~nondetString1~0.base_4, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_3} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,768 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,768 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,768 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,769 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2))) (and (<= .cse0 (select |v_#length_7| v_main_~nondetString2~0.base_2)) (and (= (store |v_#memory_int_part_locs_65_locs_65_3| v_main_~nondetString2~0.base_2 (store (select |v_#memory_int_part_locs_65_locs_65_3| v_main_~nondetString2~0.base_2) (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1)) 0)) |v_#memory_int_part_locs_65_locs_65_4|) (= |v_#memory_int_part_locs_30_locs_65_3| |v_#memory_int_part_locs_30_locs_65_4|)) (<= 1 .cse0) (= 1 (select |v_#valid_9| v_main_~nondetString2~0.base_2)))) InVars {#valid=|v_#valid_9|, #length=|v_#length_7|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_3|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_3|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} OutVars{#valid=|v_#valid_9|, #length=|v_#length_7|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_4|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_4|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_65_locs_65, #memory_int_part_locs_30_locs_65] [2018-04-06 23:59:46,769 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,769 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,769 DEBUG L290 ransitionTransformer]: (let ((.cse0 (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2))) (and (<= .cse0 (select |v_#length_7| v_main_~nondetString2~0.base_2)) (= (store |v_#memory_int_4| v_main_~nondetString2~0.base_2 (store (select |v_#memory_int_4| v_main_~nondetString2~0.base_2) (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1)) 0)) |v_#memory_int_3|) (<= 1 .cse0) (= 1 (select |v_#valid_9| v_main_~nondetString2~0.base_2)))) [2018-04-06 23:59:46,769 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,769 DEBUG L292 ransitionTransformer]: (let ((.cse0 (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2))) (and (<= .cse0 (select |v_#length_7| v_main_~nondetString2~0.base_2)) (and (= (store |v_#memory_int_part_locs_65_locs_65_3| v_main_~nondetString2~0.base_2 (store (select |v_#memory_int_part_locs_65_locs_65_3| v_main_~nondetString2~0.base_2) (+ v_main_~length2~0_6 v_main_~nondetString2~0.offset_2 (- 1)) 0)) |v_#memory_int_part_locs_65_locs_65_4|) (= |v_#memory_int_part_locs_30_locs_65_3| |v_#memory_int_part_locs_30_locs_65_4|)) (<= 1 .cse0) (= 1 (select |v_#valid_9| v_main_~nondetString2~0.base_2)))) [2018-04-06 23:59:46,769 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,769 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,769 DEBUG L298 ransitionTransformer]: {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} [2018-04-06 23:59:46,769 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,769 DEBUG L300 ransitionTransformer]: {#valid=|v_#valid_9|, #length=|v_#length_7|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_3|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_3|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} [2018-04-06 23:59:46,770 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,770 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,770 DEBUG L306 ransitionTransformer]: {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} [2018-04-06 23:59:46,770 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,770 DEBUG L308 ransitionTransformer]: {#valid=|v_#valid_9|, #length=|v_#length_7|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_4|, main_~length2~0=v_main_~length2~0_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_2, #memory_int_part_locs_30_locs_65=|v_#memory_int_part_locs_30_locs_65_4|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_2} [2018-04-06 23:59:46,770 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,770 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,770 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_10| v_main_~nondetString2~0.base_3))) InVars {#valid=|v_#valid_10|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_3} OutVars{#valid=|v_#valid_10|, main_~nondetString2~0.base=v_main_~nondetString2~0.base_3} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,770 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,770 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,771 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,771 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ v_main_~length2~0_7 v_main_~nondetString2~0.offset_3))) (or (not (<= .cse0 (select |v_#length_8| v_main_~nondetString2~0.base_4))) (not (<= 1 .cse0)))) InVars {#length=|v_#length_8|, main_~length2~0=v_main_~length2~0_7, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_3, main_~nondetString2~0.base=v_main_~nondetString2~0.base_4} OutVars{#length=|v_#length_8|, main_~length2~0=v_main_~length2~0_7, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_3, main_~nondetString2~0.base=v_main_~nondetString2~0.base_4} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,771 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,771 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,771 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,771 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_substring_#in~s.offsetInParam_1| v_main_~nondetString1~0.offset_5) (= |v_substring_#in~t.offsetInParam_1| v_main_~nondetString2~0.offset_5) (= |v_substring_#in~s.baseInParam_1| v_main_~nondetString1~0.base_6) (= |v_substring_#in~t.baseInParam_1| v_main_~nondetString2~0.base_6)) InVars {main_~nondetString1~0.base=v_main_~nondetString1~0.base_6, main_~nondetString2~0.offset=v_main_~nondetString2~0.offset_5, main_~nondetString1~0.offset=v_main_~nondetString1~0.offset_5, main_~nondetString2~0.base=v_main_~nondetString2~0.base_6} OutVars{substring_#in~t.offset=|v_substring_#in~t.offsetInParam_1|, substring_#in~s.base=|v_substring_#in~s.baseInParam_1|, substring_#in~s.offset=|v_substring_#in~s.offsetInParam_1|, substring_#in~t.base=|v_substring_#in~t.baseInParam_1|} AuxVars[] AssignedVars[substring_#in~t.offset, substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base] [2018-04-06 23:59:46,771 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,771 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,771 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,772 DEBUG L281 ransitionTransformer]: Formula: (and (<= |v_main_#t~ret15_2| 2147483647) (<= 0 (+ |v_main_#t~ret15_2| 2147483648))) InVars {main_#t~ret15=|v_main_#t~ret15_2|} OutVars{main_#t~ret15=|v_main_#t~ret15_2|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,772 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,772 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,772 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,772 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~s.base_1 |v_substring_#in~s.base_1|) (= v_substring_~s.offset_1 |v_substring_#in~s.offset_1|)) InVars {substring_#in~s.offset=|v_substring_#in~s.offset_1|, substring_#in~s.base=|v_substring_#in~s.base_1|} OutVars{substring_~s.base=v_substring_~s.base_1, substring_~s.offset=v_substring_~s.offset_1, substring_#in~s.offset=|v_substring_#in~s.offset_1|, substring_#in~s.base=|v_substring_#in~s.base_1|} AuxVars[] AssignedVars[substring_~s.base, substring_~s.offset] [2018-04-06 23:59:46,772 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,772 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,772 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,772 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_1| |v_main_#t~ret15_3|) InVars {main_#t~ret15=|v_main_#t~ret15_3|} OutVars{main_#t~ret15=|v_main_#t~ret15_3|, main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-06 23:59:46,772 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,773 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,773 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,773 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~t.base_1 |v_substring_#in~t.base_1|) (= v_substring_~t.offset_1 |v_substring_#in~t.offset_1|)) InVars {substring_#in~t.offset=|v_substring_#in~t.offset_1|, substring_#in~t.base=|v_substring_#in~t.base_1|} OutVars{substring_~t.base=v_substring_~t.base_1, substring_~t.offset=v_substring_~t.offset_1, substring_#in~t.offset=|v_substring_#in~t.offset_1|, substring_#in~t.base=|v_substring_#in~t.base_1|} AuxVars[] AssignedVars[substring_~t.offset, substring_~t.base] [2018-04-06 23:59:46,773 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,773 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,773 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,773 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret15=|v_main_#t~ret15_4|} AuxVars[] AssignedVars[main_#t~ret15] [2018-04-06 23:59:46,773 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,773 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,774 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,774 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~ps~0.base_1 v_substring_~s.base_2) (= v_substring_~ps~0.offset_1 v_substring_~s.offset_2)) InVars {substring_~s.base=v_substring_~s.base_2, substring_~s.offset=v_substring_~s.offset_2} OutVars{substring_~s.base=v_substring_~s.base_2, substring_~ps~0.offset=v_substring_~ps~0.offset_1, substring_~s.offset=v_substring_~s.offset_2, substring_~ps~0.base=v_substring_~ps~0.base_1} AuxVars[] AssignedVars[substring_~ps~0.offset, substring_~ps~0.base] [2018-04-06 23:59:46,774 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,774 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,774 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,774 DEBUG L281 ransitionTransformer]: Formula: (= (store |v_#valid_12| |v_main_#t~malloc13.base_3| 0) |v_#valid_11|) InVars {main_#t~malloc13.base=|v_main_#t~malloc13.base_3|, #valid=|v_#valid_12|} OutVars{main_#t~malloc13.base=|v_main_#t~malloc13.base_3|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid] [2018-04-06 23:59:46,774 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,774 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,774 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,775 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,775 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,775 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,775 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,775 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,775 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,775 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,775 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,775 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~malloc13.base=|v_main_#t~malloc13.base_4|, main_#t~malloc13.offset=|v_main_#t~malloc13.offset_4|} AuxVars[] AssignedVars[main_#t~malloc13.base, main_#t~malloc13.offset] [2018-04-06 23:59:46,775 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,775 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,776 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,776 DEBUG L281 ransitionTransformer]: Formula: (and (= 1 (select |v_#valid_17| v_substring_~ps~0.base_2)) (<= (+ v_substring_~ps~0.offset_2 1) (select |v_#length_9| v_substring_~ps~0.base_2)) (<= 0 v_substring_~ps~0.offset_2) (= (select (select |v_#memory_int_part_locs_65_locs_65_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2) |v_substring_#t~mem2_1|)) InVars {substring_~ps~0.offset=v_substring_~ps~0.offset_2, #length=|v_#length_9|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_5|, substring_~ps~0.base=v_substring_~ps~0.base_2, #valid=|v_#valid_17|} OutVars{substring_~ps~0.offset=v_substring_~ps~0.offset_2, substring_#t~mem2=|v_substring_#t~mem2_1|, #valid=|v_#valid_17|, #length=|v_#length_9|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_5|, substring_~ps~0.base=v_substring_~ps~0.base_2} AuxVars[] AssignedVars[substring_#t~mem2] [2018-04-06 23:59:46,776 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,776 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,776 DEBUG L290 ransitionTransformer]: (and (= 1 (select |v_#valid_17| v_substring_~ps~0.base_2)) (<= (+ v_substring_~ps~0.offset_2 1) (select |v_#length_9| v_substring_~ps~0.base_2)) (<= 0 v_substring_~ps~0.offset_2) (= (select (select |v_#memory_int_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2) |v_substring_#t~mem2_1|)) [2018-04-06 23:59:46,776 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,776 DEBUG L292 ransitionTransformer]: (and (= 1 (select |v_#valid_17| v_substring_~ps~0.base_2)) (<= (+ v_substring_~ps~0.offset_2 1) (select |v_#length_9| v_substring_~ps~0.base_2)) (<= 0 v_substring_~ps~0.offset_2) (= (select (select |v_#memory_int_part_locs_65_locs_65_5| v_substring_~ps~0.base_2) v_substring_~ps~0.offset_2) |v_substring_#t~mem2_1|)) [2018-04-06 23:59:46,776 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,777 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,777 DEBUG L298 ransitionTransformer]: {substring_~ps~0.offset=v_substring_~ps~0.offset_2, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, substring_~ps~0.base=v_substring_~ps~0.base_2} [2018-04-06 23:59:46,777 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,777 DEBUG L300 ransitionTransformer]: {substring_~ps~0.offset=v_substring_~ps~0.offset_2, #length=|v_#length_9|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_5|, substring_~ps~0.base=v_substring_~ps~0.base_2, #valid=|v_#valid_17|} [2018-04-06 23:59:46,777 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,777 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,777 DEBUG L306 ransitionTransformer]: {substring_~ps~0.offset=v_substring_~ps~0.offset_2, substring_#t~mem2=|v_substring_#t~mem2_1|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, substring_~ps~0.base=v_substring_~ps~0.base_2} [2018-04-06 23:59:46,777 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,777 DEBUG L308 ransitionTransformer]: {substring_~ps~0.offset=v_substring_~ps~0.offset_2, substring_#t~mem2=|v_substring_#t~mem2_1|, #valid=|v_#valid_17|, #length=|v_#length_9|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_5|, substring_~ps~0.base=v_substring_~ps~0.base_2} [2018-04-06 23:59:46,777 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,777 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,778 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_18| v_substring_~ps~0.base_3))) InVars {substring_~ps~0.base=v_substring_~ps~0.base_3, #valid=|v_#valid_18|} OutVars{substring_~ps~0.base=v_substring_~ps~0.base_3, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,778 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,778 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,778 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,778 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ v_substring_~ps~0.offset_3 1) (select |v_#length_10| v_substring_~ps~0.base_4))) (not (<= 0 v_substring_~ps~0.offset_3))) InVars {substring_~ps~0.offset=v_substring_~ps~0.offset_3, #length=|v_#length_10|, substring_~ps~0.base=v_substring_~ps~0.base_4} OutVars{substring_~ps~0.offset=v_substring_~ps~0.offset_3, #length=|v_#length_10|, substring_~ps~0.base=v_substring_~ps~0.base_4} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,778 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,778 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,778 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,778 DEBUG L281 ransitionTransformer]: Formula: (= |v_substring_#res_2| 0) InVars {} OutVars{substring_#res=|v_substring_#res_2|} AuxVars[] AssignedVars[substring_#res] [2018-04-06 23:59:46,778 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,779 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,779 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,779 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_13| (store |v_#valid_14| |v_main_#t~malloc14.base_3| 0)) InVars {main_#t~malloc14.base=|v_main_#t~malloc14.base_3|, #valid=|v_#valid_14|} OutVars{main_#t~malloc14.base=|v_main_#t~malloc14.base_3|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid] [2018-04-06 23:59:46,779 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,779 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,779 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,779 DEBUG L281 ransitionTransformer]: Formula: (= 0 |v_substring_#t~mem2_2|) InVars {substring_#t~mem2=|v_substring_#t~mem2_2|} OutVars{substring_#t~mem2=|v_substring_#t~mem2_2|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,779 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,779 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,779 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,780 DEBUG L281 ransitionTransformer]: Formula: (not (= 0 |v_substring_#t~mem2_4|)) InVars {substring_#t~mem2=|v_substring_#t~mem2_4|} OutVars{substring_#t~mem2=|v_substring_#t~mem2_4|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,780 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,780 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,780 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,780 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,780 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,780 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,780 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,780 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~malloc14.offset=|v_main_#t~malloc14.offset_4|, main_#t~malloc14.base=|v_main_#t~malloc14.base_4|} AuxVars[] AssignedVars[main_#t~malloc14.offset, main_#t~malloc14.base] [2018-04-06 23:59:46,780 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,780 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,781 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,781 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem2=|v_substring_#t~mem2_3|} AuxVars[] AssignedVars[substring_#t~mem2] [2018-04-06 23:59:46,781 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,781 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,781 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,781 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem2=|v_substring_#t~mem2_5|} AuxVars[] AssignedVars[substring_#t~mem2] [2018-04-06 23:59:46,781 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,781 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,781 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,782 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_15| |old(#valid)|) InVars {#valid=|v_#valid_15|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_15|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,782 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,782 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,782 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,782 DEBUG L281 ransitionTransformer]: Formula: (not (= |v_#valid_16| |old(#valid)|)) InVars {#valid=|v_#valid_16|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_16|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,782 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,782 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,783 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,783 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~ps2~0.offset_1 v_substring_~ps~0.offset_4) (= v_substring_~ps2~0.base_1 v_substring_~ps~0.base_5)) InVars {substring_~ps~0.offset=v_substring_~ps~0.offset_4, substring_~ps~0.base=v_substring_~ps~0.base_5} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_1, substring_~ps~0.offset=v_substring_~ps~0.offset_4, substring_~ps~0.base=v_substring_~ps~0.base_5, substring_~ps2~0.offset=v_substring_~ps2~0.offset_1} AuxVars[] AssignedVars[substring_~ps2~0.base, substring_~ps2~0.offset] [2018-04-06 23:59:46,783 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,783 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,783 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,783 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~pt~0.offset_1 v_substring_~t.offset_2) (= v_substring_~pt~0.base_1 v_substring_~t.base_2)) InVars {substring_~t.base=v_substring_~t.base_2, substring_~t.offset=v_substring_~t.offset_2} OutVars{substring_~t.base=v_substring_~t.base_2, substring_~t.offset=v_substring_~t.offset_2, substring_~pt~0.base=v_substring_~pt~0.base_1, substring_~pt~0.offset=v_substring_~pt~0.offset_1} AuxVars[] AssignedVars[substring_~pt~0.base, substring_~pt~0.offset] [2018-04-06 23:59:46,783 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,783 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,783 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,784 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,784 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,784 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,784 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,784 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,784 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,784 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,785 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,785 DEBUG L281 ransitionTransformer]: Formula: (and (<= (+ v_substring_~pt~0.offset_2 1) (select |v_#length_11| v_substring_~pt~0.base_2)) (= |v_substring_#t~mem3_1| (select (select |v_#memory_int_part_locs_65_locs_65_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2)) (<= 0 v_substring_~pt~0.offset_2) (= 1 (select |v_#valid_19| v_substring_~pt~0.base_2))) InVars {#length=|v_#length_11|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_6|, substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|} OutVars{substring_#t~mem3=|v_substring_#t~mem3_1|, substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|, #length=|v_#length_11|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_6|} AuxVars[] AssignedVars[substring_#t~mem3] [2018-04-06 23:59:46,785 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,785 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,785 DEBUG L290 ransitionTransformer]: (and (<= (+ v_substring_~pt~0.offset_2 1) (select |v_#length_11| v_substring_~pt~0.base_2)) (= |v_substring_#t~mem3_1| (select (select |v_#memory_int_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2)) (<= 0 v_substring_~pt~0.offset_2) (= 1 (select |v_#valid_19| v_substring_~pt~0.base_2))) [2018-04-06 23:59:46,785 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,785 DEBUG L292 ransitionTransformer]: (and (<= (+ v_substring_~pt~0.offset_2 1) (select |v_#length_11| v_substring_~pt~0.base_2)) (= |v_substring_#t~mem3_1| (select (select |v_#memory_int_part_locs_65_locs_65_6| v_substring_~pt~0.base_2) v_substring_~pt~0.offset_2)) (<= 0 v_substring_~pt~0.offset_2) (= 1 (select |v_#valid_19| v_substring_~pt~0.base_2))) [2018-04-06 23:59:46,785 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,785 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,785 DEBUG L298 ransitionTransformer]: {substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} [2018-04-06 23:59:46,786 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,786 DEBUG L300 ransitionTransformer]: {#length=|v_#length_11|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_6|, substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|} [2018-04-06 23:59:46,786 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,786 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,786 DEBUG L306 ransitionTransformer]: {substring_#t~mem3=|v_substring_#t~mem3_1|, substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} [2018-04-06 23:59:46,786 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,786 DEBUG L308 ransitionTransformer]: {substring_#t~mem3=|v_substring_#t~mem3_1|, substring_~pt~0.base=v_substring_~pt~0.base_2, substring_~pt~0.offset=v_substring_~pt~0.offset_2, #valid=|v_#valid_19|, #length=|v_#length_11|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_6|} [2018-04-06 23:59:46,786 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,786 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,786 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_20| v_substring_~pt~0.base_3) 1)) InVars {substring_~pt~0.base=v_substring_~pt~0.base_3, #valid=|v_#valid_20|} OutVars{substring_~pt~0.base=v_substring_~pt~0.base_3, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,787 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,787 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,787 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,787 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v_substring_~pt~0.offset_3)) (not (<= (+ v_substring_~pt~0.offset_3 1) (select |v_#length_12| v_substring_~pt~0.base_4)))) InVars {#length=|v_#length_12|, substring_~pt~0.base=v_substring_~pt~0.base_4, substring_~pt~0.offset=v_substring_~pt~0.offset_3} OutVars{#length=|v_#length_12|, substring_~pt~0.base=v_substring_~pt~0.base_4, substring_~pt~0.offset=v_substring_~pt~0.offset_3} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,787 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,787 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,787 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,788 DEBUG L281 ransitionTransformer]: Formula: (and (<= (+ v_substring_~pt~0.offset_8 1) (select |v_#length_17| v_substring_~pt~0.base_10)) (= (select (select |v_#memory_int_part_locs_65_locs_65_7| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8) |v_substring_#t~mem9_1|) (<= 0 v_substring_~pt~0.offset_8) (= (select |v_#valid_25| v_substring_~pt~0.base_10) 1)) InVars {#length=|v_#length_17|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_7|, substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|} OutVars{substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|, #length=|v_#length_17|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_7|, substring_#t~mem9=|v_substring_#t~mem9_1|} AuxVars[] AssignedVars[substring_#t~mem9] [2018-04-06 23:59:46,788 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,788 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,788 DEBUG L290 ransitionTransformer]: (and (<= (+ v_substring_~pt~0.offset_8 1) (select |v_#length_17| v_substring_~pt~0.base_10)) (= (select (select |v_#memory_int_9| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8) |v_substring_#t~mem9_1|) (<= 0 v_substring_~pt~0.offset_8) (= (select |v_#valid_25| v_substring_~pt~0.base_10) 1)) [2018-04-06 23:59:46,788 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,788 DEBUG L292 ransitionTransformer]: (and (<= (+ v_substring_~pt~0.offset_8 1) (select |v_#length_17| v_substring_~pt~0.base_10)) (= (select (select |v_#memory_int_part_locs_65_locs_65_7| v_substring_~pt~0.base_10) v_substring_~pt~0.offset_8) |v_substring_#t~mem9_1|) (<= 0 v_substring_~pt~0.offset_8) (= (select |v_#valid_25| v_substring_~pt~0.base_10) 1)) [2018-04-06 23:59:46,788 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,788 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,788 DEBUG L298 ransitionTransformer]: {substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|} [2018-04-06 23:59:46,788 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,788 DEBUG L300 ransitionTransformer]: {#length=|v_#length_17|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_7|, substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|} [2018-04-06 23:59:46,788 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,789 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,789 DEBUG L306 ransitionTransformer]: {substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, substring_#t~mem9=|v_substring_#t~mem9_1|} [2018-04-06 23:59:46,789 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,789 DEBUG L308 ransitionTransformer]: {substring_~pt~0.base=v_substring_~pt~0.base_10, substring_~pt~0.offset=v_substring_~pt~0.offset_8, #valid=|v_#valid_25|, #length=|v_#length_17|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_7|, substring_#t~mem9=|v_substring_#t~mem9_1|} [2018-04-06 23:59:46,789 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,789 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,789 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_26| v_substring_~pt~0.base_11) 1)) InVars {substring_~pt~0.base=v_substring_~pt~0.base_11, #valid=|v_#valid_26|} OutVars{substring_~pt~0.base=v_substring_~pt~0.base_11, #valid=|v_#valid_26|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,790 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,790 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,790 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,790 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v_substring_~pt~0.offset_9)) (not (<= (+ v_substring_~pt~0.offset_9 1) (select |v_#length_18| v_substring_~pt~0.base_12)))) InVars {#length=|v_#length_18|, substring_~pt~0.base=v_substring_~pt~0.base_12, substring_~pt~0.offset=v_substring_~pt~0.offset_9} OutVars{#length=|v_#length_18|, substring_~pt~0.base=v_substring_~pt~0.base_12, substring_~pt~0.offset=v_substring_~pt~0.offset_9} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,790 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,790 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,791 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,791 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (= 0 |v_substring_#t~mem3_2|))) (or (and (not .cse0) |v_substring_#t~short6_1|) (and (not |v_substring_#t~short6_1|) .cse0))) InVars {substring_#t~mem3=|v_substring_#t~mem3_2|} OutVars{substring_#t~mem3=|v_substring_#t~mem3_2|, substring_#t~short6=|v_substring_#t~short6_1|} AuxVars[] AssignedVars[substring_#t~short6] [2018-04-06 23:59:46,791 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,791 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,791 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,791 DEBUG L281 ransitionTransformer]: Formula: (= 0 |v_substring_#t~mem9_2|) InVars {substring_#t~mem9=|v_substring_#t~mem9_2|} OutVars{substring_#t~mem9=|v_substring_#t~mem9_2|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,792 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,792 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,792 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,792 DEBUG L281 ransitionTransformer]: Formula: (not (= 0 |v_substring_#t~mem9_4|)) InVars {substring_#t~mem9=|v_substring_#t~mem9_4|} OutVars{substring_#t~mem9=|v_substring_#t~mem9_4|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,792 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,792 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,793 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,793 DEBUG L281 ransitionTransformer]: Formula: |v_substring_#t~short6_2| InVars {substring_#t~short6=|v_substring_#t~short6_2|} OutVars{substring_#t~short6=|v_substring_#t~short6_2|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,793 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,793 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,793 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,793 DEBUG L281 ransitionTransformer]: Formula: (not |v_substring_#t~short6_4|) InVars {substring_#t~short6=|v_substring_#t~short6_4|} OutVars{substring_#t~short6=|v_substring_#t~short6_4|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,793 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,794 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,794 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,794 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem9=|v_substring_#t~mem9_3|} AuxVars[] AssignedVars[substring_#t~mem9] [2018-04-06 23:59:46,794 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,794 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,794 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,794 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem9=|v_substring_#t~mem9_5|} AuxVars[] AssignedVars[substring_#t~mem9] [2018-04-06 23:59:46,795 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,795 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,795 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,795 DEBUG L281 ransitionTransformer]: Formula: (and (= 1 (select |v_#valid_21| v_substring_~pt~0.base_5)) (<= 0 v_substring_~pt~0.offset_4) (= (select (select |v_#memory_int_part_locs_65_locs_65_8| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4) |v_substring_#t~mem4_1|) (<= (+ v_substring_~pt~0.offset_4 1) (select |v_#length_13| v_substring_~pt~0.base_5))) InVars {#length=|v_#length_13|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_8|, substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|} OutVars{substring_#t~mem4=|v_substring_#t~mem4_1|, substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|, #length=|v_#length_13|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_8|} AuxVars[] AssignedVars[substring_#t~mem4] [2018-04-06 23:59:46,795 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,796 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,796 DEBUG L290 ransitionTransformer]: (and (= 1 (select |v_#valid_21| v_substring_~pt~0.base_5)) (<= 0 v_substring_~pt~0.offset_4) (= (select (select |v_#memory_int_7| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4) |v_substring_#t~mem4_1|) (<= (+ v_substring_~pt~0.offset_4 1) (select |v_#length_13| v_substring_~pt~0.base_5))) [2018-04-06 23:59:46,796 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,796 DEBUG L292 ransitionTransformer]: (and (= 1 (select |v_#valid_21| v_substring_~pt~0.base_5)) (<= 0 v_substring_~pt~0.offset_4) (= (select (select |v_#memory_int_part_locs_65_locs_65_8| v_substring_~pt~0.base_5) v_substring_~pt~0.offset_4) |v_substring_#t~mem4_1|) (<= (+ v_substring_~pt~0.offset_4 1) (select |v_#length_13| v_substring_~pt~0.base_5))) [2018-04-06 23:59:46,796 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,796 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,796 DEBUG L298 ransitionTransformer]: {substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} [2018-04-06 23:59:46,797 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,797 DEBUG L300 ransitionTransformer]: {#length=|v_#length_13|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_8|, substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|} [2018-04-06 23:59:46,797 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,797 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,797 DEBUG L306 ransitionTransformer]: {substring_#t~mem4=|v_substring_#t~mem4_1|, substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} [2018-04-06 23:59:46,797 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,797 DEBUG L308 ransitionTransformer]: {substring_#t~mem4=|v_substring_#t~mem4_1|, substring_~pt~0.base=v_substring_~pt~0.base_5, substring_~pt~0.offset=v_substring_~pt~0.offset_4, #valid=|v_#valid_21|, #length=|v_#length_13|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_8|} [2018-04-06 23:59:46,798 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,798 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,798 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_22| v_substring_~pt~0.base_6))) InVars {substring_~pt~0.base=v_substring_~pt~0.base_6, #valid=|v_#valid_22|} OutVars{substring_~pt~0.base=v_substring_~pt~0.base_6, #valid=|v_#valid_22|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,798 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,798 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,798 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,799 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ v_substring_~pt~0.offset_5 1) (select |v_#length_14| v_substring_~pt~0.base_7))) (not (<= 0 v_substring_~pt~0.offset_5))) InVars {#length=|v_#length_14|, substring_~pt~0.base=v_substring_~pt~0.base_7, substring_~pt~0.offset=v_substring_~pt~0.offset_5} OutVars{#length=|v_#length_14|, substring_~pt~0.base=v_substring_~pt~0.base_7, substring_~pt~0.offset=v_substring_~pt~0.offset_5} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,799 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,799 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,799 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,799 DEBUG L281 ransitionTransformer]: Formula: (not |v_substring_#t~short6_5|) InVars {substring_#t~short6=|v_substring_#t~short6_5|} OutVars{substring_#t~short6=|v_substring_#t~short6_5|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,799 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,800 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,800 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,800 DEBUG L281 ransitionTransformer]: Formula: |v_substring_#t~short6_7| InVars {substring_#t~short6=|v_substring_#t~short6_7|} OutVars{substring_#t~short6=|v_substring_#t~short6_7|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,800 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,800 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,800 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,800 DEBUG L281 ransitionTransformer]: Formula: (= |v_substring_#res_1| 1) InVars {} OutVars{substring_#res=|v_substring_#res_1|} AuxVars[] AssignedVars[substring_#res] [2018-04-06 23:59:46,801 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,801 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,801 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,801 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_substring_#t~post10.base_1| v_substring_~ps~0.base_6) (= |v_substring_#t~post10.offset_1| v_substring_~ps~0.offset_5)) InVars {substring_~ps~0.offset=v_substring_~ps~0.offset_5, substring_~ps~0.base=v_substring_~ps~0.base_6} OutVars{substring_#t~post10.offset=|v_substring_#t~post10.offset_1|, substring_#t~post10.base=|v_substring_#t~post10.base_1|, substring_~ps~0.offset=v_substring_~ps~0.offset_5, substring_~ps~0.base=v_substring_~ps~0.base_6} AuxVars[] AssignedVars[substring_#t~post10.offset, substring_#t~post10.base] [2018-04-06 23:59:46,801 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,801 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,802 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,802 DEBUG L281 ransitionTransformer]: Formula: (and (<= 0 v_substring_~ps2~0.offset_2) (<= (+ v_substring_~ps2~0.offset_2 1) (select |v_#length_15| v_substring_~ps2~0.base_2)) (= 1 (select |v_#valid_23| v_substring_~ps2~0.base_2)) (= (select (select |v_#memory_int_part_locs_65_locs_65_9| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2) |v_substring_#t~mem5_1|)) InVars {substring_~ps2~0.base=v_substring_~ps2~0.base_2, #length=|v_#length_15|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_9|, #valid=|v_#valid_23|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_2, #valid=|v_#valid_23|, #length=|v_#length_15|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_9|, substring_#t~mem5=|v_substring_#t~mem5_1|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} AuxVars[] AssignedVars[substring_#t~mem5] [2018-04-06 23:59:46,802 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-06 23:59:46,802 DEBUG L289 ransitionTransformer]: old formula: [2018-04-06 23:59:46,802 DEBUG L290 ransitionTransformer]: (and (<= 0 v_substring_~ps2~0.offset_2) (<= (+ v_substring_~ps2~0.offset_2 1) (select |v_#length_15| v_substring_~ps2~0.base_2)) (= 1 (select |v_#valid_23| v_substring_~ps2~0.base_2)) (= (select (select |v_#memory_int_8| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2) |v_substring_#t~mem5_1|)) [2018-04-06 23:59:46,803 DEBUG L291 ransitionTransformer]: new formula: [2018-04-06 23:59:46,803 DEBUG L292 ransitionTransformer]: (and (<= 0 v_substring_~ps2~0.offset_2) (<= (+ v_substring_~ps2~0.offset_2 1) (select |v_#length_15| v_substring_~ps2~0.base_2)) (= 1 (select |v_#valid_23| v_substring_~ps2~0.base_2)) (= (select (select |v_#memory_int_part_locs_65_locs_65_9| v_substring_~ps2~0.base_2) v_substring_~ps2~0.offset_2) |v_substring_#t~mem5_1|)) [2018-04-06 23:59:46,803 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-06 23:59:46,803 DEBUG L297 ransitionTransformer]: old invars: [2018-04-06 23:59:46,803 DEBUG L298 ransitionTransformer]: {substring_~ps2~0.base=v_substring_~ps2~0.base_2, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} [2018-04-06 23:59:46,803 DEBUG L299 ransitionTransformer]: new invars: [2018-04-06 23:59:46,803 DEBUG L300 ransitionTransformer]: {substring_~ps2~0.base=v_substring_~ps2~0.base_2, #length=|v_#length_15|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_9|, #valid=|v_#valid_23|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} [2018-04-06 23:59:46,804 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-06 23:59:46,804 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-06 23:59:46,804 DEBUG L306 ransitionTransformer]: {substring_~ps2~0.base=v_substring_~ps2~0.base_2, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, substring_#t~mem5=|v_substring_#t~mem5_1|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} [2018-04-06 23:59:46,804 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-06 23:59:46,804 DEBUG L308 ransitionTransformer]: {substring_~ps2~0.base=v_substring_~ps2~0.base_2, #valid=|v_#valid_23|, #length=|v_#length_15|, #memory_int_part_locs_65_locs_65=|v_#memory_int_part_locs_65_locs_65_9|, substring_#t~mem5=|v_substring_#t~mem5_1|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_2} [2018-04-06 23:59:46,804 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,805 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,805 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_24| v_substring_~ps2~0.base_3))) InVars {substring_~ps2~0.base=v_substring_~ps2~0.base_3, #valid=|v_#valid_24|} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_3, #valid=|v_#valid_24|} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,805 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,805 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,805 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,805 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ v_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_substring_~ps2~0.base_4))) (not (<= 0 v_substring_~ps2~0.offset_3))) InVars {substring_~ps2~0.base=v_substring_~ps2~0.base_4, #length=|v_#length_16|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_3} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_4, #length=|v_#length_16|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_3} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,805 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,806 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,806 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,806 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem3=|v_substring_#t~mem3_3|} AuxVars[] AssignedVars[substring_#t~mem3] [2018-04-06 23:59:46,806 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,806 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,806 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,807 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem3=|v_substring_#t~mem3_4|} AuxVars[] AssignedVars[substring_#t~mem3] [2018-04-06 23:59:46,807 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,807 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,807 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,807 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~ps~0.offset_6 (+ |v_substring_#t~post10.offset_2| 1)) (= v_substring_~ps~0.base_7 |v_substring_#t~post10.base_2|)) InVars {substring_#t~post10.offset=|v_substring_#t~post10.offset_2|, substring_#t~post10.base=|v_substring_#t~post10.base_2|} OutVars{substring_#t~post10.offset=|v_substring_#t~post10.offset_2|, substring_~ps~0.offset=v_substring_~ps~0.offset_6, substring_#t~post10.base=|v_substring_#t~post10.base_2|, substring_~ps~0.base=v_substring_~ps~0.base_7} AuxVars[] AssignedVars[substring_~ps~0.offset, substring_~ps~0.base] [2018-04-06 23:59:46,807 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,808 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,808 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,808 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (= |v_substring_#t~mem5_2| |v_substring_#t~mem4_2|))) (or (and |v_substring_#t~short6_3| .cse0) (and (not |v_substring_#t~short6_3|) (not .cse0)))) InVars {substring_#t~mem4=|v_substring_#t~mem4_2|, substring_#t~mem5=|v_substring_#t~mem5_2|} OutVars{substring_#t~mem4=|v_substring_#t~mem4_2|, substring_#t~short6=|v_substring_#t~short6_3|, substring_#t~mem5=|v_substring_#t~mem5_2|} AuxVars[] AssignedVars[substring_#t~short6] [2018-04-06 23:59:46,808 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,808 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,808 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,809 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem5=|v_substring_#t~mem5_3|} AuxVars[] AssignedVars[substring_#t~mem5] [2018-04-06 23:59:46,809 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,809 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,809 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,809 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem5=|v_substring_#t~mem5_4|} AuxVars[] AssignedVars[substring_#t~mem5] [2018-04-06 23:59:46,809 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,809 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,810 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,810 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~post10.offset=|v_substring_#t~post10.offset_3|, substring_#t~post10.base=|v_substring_#t~post10.base_3|} AuxVars[] AssignedVars[substring_#t~post10.offset, substring_#t~post10.base] [2018-04-06 23:59:46,810 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,810 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,810 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,810 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~short6=|v_substring_#t~short6_6|} AuxVars[] AssignedVars[substring_#t~short6] [2018-04-06 23:59:46,810 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,811 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,811 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,811 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~short6=|v_substring_#t~short6_8|} AuxVars[] AssignedVars[substring_#t~short6] [2018-04-06 23:59:46,811 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,811 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,811 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,811 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem4=|v_substring_#t~mem4_3|} AuxVars[] AssignedVars[substring_#t~mem4] [2018-04-06 23:59:46,812 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,812 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,812 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,812 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~mem4=|v_substring_#t~mem4_4|} AuxVars[] AssignedVars[substring_#t~mem4] [2018-04-06 23:59:46,812 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,812 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,813 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,813 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_substring_#t~post7.base_1| v_substring_~pt~0.base_8) (= |v_substring_#t~post7.offset_1| v_substring_~pt~0.offset_6)) InVars {substring_~pt~0.base=v_substring_~pt~0.base_8, substring_~pt~0.offset=v_substring_~pt~0.offset_6} OutVars{substring_#t~post7.offset=|v_substring_#t~post7.offset_1|, substring_~pt~0.base=v_substring_~pt~0.base_8, substring_#t~post7.base=|v_substring_#t~post7.base_1|, substring_~pt~0.offset=v_substring_~pt~0.offset_6} AuxVars[] AssignedVars[substring_#t~post7.base, substring_#t~post7.offset] [2018-04-06 23:59:46,813 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,813 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,813 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,813 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~pt~0.offset_7 (+ |v_substring_#t~post7.offset_2| 1)) (= v_substring_~pt~0.base_9 |v_substring_#t~post7.base_2|)) InVars {substring_#t~post7.offset=|v_substring_#t~post7.offset_2|, substring_#t~post7.base=|v_substring_#t~post7.base_2|} OutVars{substring_#t~post7.offset=|v_substring_#t~post7.offset_2|, substring_~pt~0.base=v_substring_~pt~0.base_9, substring_~pt~0.offset=v_substring_~pt~0.offset_7, substring_#t~post7.base=|v_substring_#t~post7.base_2|} AuxVars[] AssignedVars[substring_~pt~0.base, substring_~pt~0.offset] [2018-04-06 23:59:46,813 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,814 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,814 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,814 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~post7.offset=|v_substring_#t~post7.offset_3|, substring_#t~post7.base=|v_substring_#t~post7.base_3|} AuxVars[] AssignedVars[substring_#t~post7.base, substring_#t~post7.offset] [2018-04-06 23:59:46,814 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,814 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,815 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,815 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_substring_#t~post8.base_1| v_substring_~ps2~0.base_5) (= |v_substring_#t~post8.offset_1| v_substring_~ps2~0.offset_4)) InVars {substring_~ps2~0.base=v_substring_~ps2~0.base_5, substring_~ps2~0.offset=v_substring_~ps2~0.offset_4} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_5, substring_#t~post8.base=|v_substring_#t~post8.base_1|, substring_#t~post8.offset=|v_substring_#t~post8.offset_1|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_4} AuxVars[] AssignedVars[substring_#t~post8.offset, substring_#t~post8.base] [2018-04-06 23:59:46,815 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,815 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,815 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,815 DEBUG L281 ransitionTransformer]: Formula: (and (= v_substring_~ps2~0.base_6 |v_substring_#t~post8.base_2|) (= v_substring_~ps2~0.offset_5 (+ |v_substring_#t~post8.offset_2| 1))) InVars {substring_#t~post8.offset=|v_substring_#t~post8.offset_2|, substring_#t~post8.base=|v_substring_#t~post8.base_2|} OutVars{substring_~ps2~0.base=v_substring_~ps2~0.base_6, substring_#t~post8.base=|v_substring_#t~post8.base_2|, substring_#t~post8.offset=|v_substring_#t~post8.offset_2|, substring_~ps2~0.offset=v_substring_~ps2~0.offset_5} AuxVars[] AssignedVars[substring_~ps2~0.base, substring_~ps2~0.offset] [2018-04-06 23:59:46,815 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,816 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,816 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,816 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{substring_#t~post8.offset=|v_substring_#t~post8.offset_3|, substring_#t~post8.base=|v_substring_#t~post8.base_3|} AuxVars[] AssignedVars[substring_#t~post8.offset, substring_#t~post8.base] [2018-04-06 23:59:46,816 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,816 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,816 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,816 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-06 23:59:46,817 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,817 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,817 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,817 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~ret15_5| |v_substring_#resOutParam_1|) InVars {substring_#res=|v_substring_#resOutParam_1|} OutVars{main_#t~ret15=|v_main_#t~ret15_5|} AuxVars[] AssignedVars[main_#t~ret15] [2018-04-06 23:59:46,817 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,817 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,818 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-06 23:59:46,818 DEBUG L281 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret16_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret16=|v_ULTIMATE.start_#t~ret16_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16] [2018-04-06 23:59:46,818 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-06 23:59:46,818 DEBUG L310 ransitionTransformer]: [2018-04-06 23:59:46,819 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 23:59:46,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:59:46 BasicIcfg [2018-04-06 23:59:46,837 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-06 23:59:46,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 23:59:46,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 23:59:46,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 23:59:46,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 11:56:05" (1/4) ... [2018-04-06 23:59:46,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e15a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:59:46, skipping insertion in model container [2018-04-06 23:59:46,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:56:06" (2/4) ... [2018-04-06 23:59:46,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e15a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:59:46, skipping insertion in model container [2018-04-06 23:59:46,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:56:06" (3/4) ... [2018-04-06 23:59:46,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e15a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:59:46, skipping insertion in model container [2018-04-06 23:59:46,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:59:46" (4/4) ... [2018-04-06 23:59:46,845 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-06 23:59:46,855 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 23:59:46,863 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-06 23:59:46,897 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 23:59:46,898 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 23:59:46,898 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 23:59:46,898 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 23:59:46,898 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 23:59:46,898 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 23:59:46,898 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 23:59:46,898 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 23:59:46,898 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 23:59:46,899 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 23:59:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-04-06 23:59:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 23:59:46,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:46,917 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:46,917 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1582198097, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:46,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:46,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:47,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:47,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 23:59:47,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 23:59:47,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:47,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 23:59:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,089 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,165 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:47,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 23:59:47,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 23:59:47,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 23:59:47,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 23:59:47,176 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-04-06 23:59:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:47,268 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-04-06 23:59:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 23:59:47,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-06 23:59:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:47,282 INFO L225 Difference]: With dead ends: 154 [2018-04-06 23:59:47,282 INFO L226 Difference]: Without dead ends: 88 [2018-04-06 23:59:47,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 23:59:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-06 23:59:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-06 23:59:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-06 23:59:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-06 23:59:47,320 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 19 [2018-04-06 23:59:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:47,320 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-06 23:59:47,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 23:59:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-06 23:59:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 23:59:47,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:47,321 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:47,321 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1582198096, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:47,330 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:47,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:47,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:47,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:47,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-06 23:59:47,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:47,420 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 15 [2018-04-06 23:59:47,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:47,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:47,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 23:59:47,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-06 23:59:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,479 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:47,577 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,577 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-06 23:59:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,623 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:47,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 23:59:47,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 23:59:47,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 23:59:47,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-06 23:59:47,625 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 9 states. [2018-04-06 23:59:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:47,814 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-06 23:59:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 23:59:47,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-06 23:59:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:47,816 INFO L225 Difference]: With dead ends: 88 [2018-04-06 23:59:47,817 INFO L226 Difference]: Without dead ends: 87 [2018-04-06 23:59:47,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-06 23:59:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-06 23:59:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-06 23:59:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-06 23:59:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-06 23:59:47,826 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-04-06 23:59:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:47,826 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-06 23:59:47,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 23:59:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-06 23:59:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 23:59:47,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:47,827 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-06 23:59:47,828 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1803500557, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:47,842 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:47,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:47,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:47,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:47,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 23:59:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:47,977 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:47,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 23:59:47,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 23:59:47,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 23:59:47,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 23:59:47,979 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-04-06 23:59:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:48,023 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-06 23:59:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 23:59:48,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-06 23:59:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:48,024 INFO L225 Difference]: With dead ends: 87 [2018-04-06 23:59:48,024 INFO L226 Difference]: Without dead ends: 86 [2018-04-06 23:59:48,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-06 23:59:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-06 23:59:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-06 23:59:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-06 23:59:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-06 23:59:48,029 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-04-06 23:59:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:48,029 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-06 23:59:48,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 23:59:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-06 23:59:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 23:59:48,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:48,030 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-06 23:59:48,030 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1803500556, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:48,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:48,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:48,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:48,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-06 23:59:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,126 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,165 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:48,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 23:59:48,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 23:59:48,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 23:59:48,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 23:59:48,166 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 7 states. [2018-04-06 23:59:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:48,226 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-06 23:59:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 23:59:48,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-06 23:59:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:48,227 INFO L225 Difference]: With dead ends: 86 [2018-04-06 23:59:48,228 INFO L226 Difference]: Without dead ends: 85 [2018-04-06 23:59:48,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 23:59:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-06 23:59:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-06 23:59:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 23:59:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-06 23:59:48,233 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-04-06 23:59:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:48,234 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-06 23:59:48,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 23:59:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-06 23:59:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-06 23:59:48,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:48,235 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-06 23:59:48,235 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash 631909275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:48,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:48,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,336 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:48,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 23:59:48,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 23:59:48,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:48,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 23:59:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,383 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:48,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-06 23:59:48,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 23:59:48,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 23:59:48,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 23:59:48,384 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 9 states. [2018-04-06 23:59:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:48,521 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-06 23:59:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 23:59:48,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-06 23:59:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:48,522 INFO L225 Difference]: With dead ends: 89 [2018-04-06 23:59:48,522 INFO L226 Difference]: Without dead ends: 88 [2018-04-06 23:59:48,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-06 23:59:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-06 23:59:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-04-06 23:59:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-06 23:59:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-06 23:59:48,528 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-04-06 23:59:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:48,528 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-06 23:59:48,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 23:59:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-06 23:59:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-06 23:59:48,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:48,529 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-06 23:59:48,529 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash 631909274, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:48,540 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:48,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,571 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,595 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:48,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 23:59:48,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 23:59:48,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 23:59:48,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 23:59:48,596 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 6 states. [2018-04-06 23:59:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:48,662 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-06 23:59:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 23:59:48,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-06 23:59:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:48,663 INFO L225 Difference]: With dead ends: 88 [2018-04-06 23:59:48,663 INFO L226 Difference]: Without dead ends: 87 [2018-04-06 23:59:48,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-06 23:59:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-06 23:59:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-06 23:59:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-06 23:59:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-06 23:59:48,671 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 26 [2018-04-06 23:59:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:48,671 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-06 23:59:48,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 23:59:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-06 23:59:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 23:59:48,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:48,672 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] [2018-04-06 23:59:48,672 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1238205407, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:48,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:48,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,758 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:48,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 23:59:48,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 23:59:48,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 23:59:48,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 23:59:48,759 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-04-06 23:59:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:48,819 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-04-06 23:59:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 23:59:48,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-06 23:59:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:48,823 INFO L225 Difference]: With dead ends: 99 [2018-04-06 23:59:48,823 INFO L226 Difference]: Without dead ends: 96 [2018-04-06 23:59:48,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-06 23:59:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-06 23:59:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-04-06 23:59:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-06 23:59:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-06 23:59:48,829 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 32 [2018-04-06 23:59:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:48,829 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-06 23:59:48,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 23:59:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-06 23:59:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 23:59:48,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:48,830 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] [2018-04-06 23:59:48,830 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1238205406, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:48,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:48,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,895 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:48,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 23:59:48,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 23:59:48,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:48,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:48,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 23:59:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:48,940 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:48,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-06 23:59:48,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 23:59:48,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 23:59:48,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 23:59:48,941 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-04-06 23:59:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:49,051 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-06 23:59:49,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 23:59:49,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-06 23:59:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:49,053 INFO L225 Difference]: With dead ends: 96 [2018-04-06 23:59:49,053 INFO L226 Difference]: Without dead ends: 93 [2018-04-06 23:59:49,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-06 23:59:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-06 23:59:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-04-06 23:59:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 23:59:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-06 23:59:49,058 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 32 [2018-04-06 23:59:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:49,058 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-06 23:59:49,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 23:59:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-06 23:59:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 23:59:49,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:49,060 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-06 23:59:49,060 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 584192395, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:49,066 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:49,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,144 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:49,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 23:59:49,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 23:59:49,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 23:59:49,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 23:59:49,145 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 7 states. [2018-04-06 23:59:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:49,234 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-06 23:59:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 23:59:49,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-04-06 23:59:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:49,235 INFO L225 Difference]: With dead ends: 124 [2018-04-06 23:59:49,235 INFO L226 Difference]: Without dead ends: 123 [2018-04-06 23:59:49,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-06 23:59:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-06 23:59:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-06 23:59:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-06 23:59:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-06 23:59:49,243 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 36 [2018-04-06 23:59:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:49,243 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-06 23:59:49,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 23:59:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-06 23:59:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 23:59:49,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:49,244 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-06 23:59:49,244 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 584192396, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:49,253 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:49,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 23:59:49,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:49,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:49,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:3 [2018-04-06 23:59:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,491 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:49,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-04-06 23:59:49,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 23:59:49,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 23:59:49,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-06 23:59:49,492 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 13 states. [2018-04-06 23:59:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:49,632 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-06 23:59:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 23:59:49,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-06 23:59:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:49,633 INFO L225 Difference]: With dead ends: 123 [2018-04-06 23:59:49,633 INFO L226 Difference]: Without dead ends: 122 [2018-04-06 23:59:49,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-04-06 23:59:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-06 23:59:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-04-06 23:59:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-06 23:59:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-06 23:59:49,639 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-04-06 23:59:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:49,640 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-06 23:59:49,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 23:59:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-06 23:59:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 23:59:49,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:49,641 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:49,641 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash -115918380, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:49,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:49,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:49,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:49,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 23:59:49,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 23:59:49,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:49,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:49,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:49,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 23:59:49,770 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 23:59:49,776 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 23:59:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,782 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:49,835 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_18|))) (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_18| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_18| 0) |c_old(#valid)|))) is different from false [2018-04-06 23:59:49,851 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_18| Int) (|v_main_#t~malloc13.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_17| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_17|))) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_18|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_18| 1) |v_main_#t~malloc13.base_17| 0) |v_main_#t~malloc14.base_18| 0))))) is different from false [2018-04-06 23:59:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:49,934 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:49,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 23:59:49,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 23:59:49,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 23:59:49,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 23:59:49,935 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 12 states. [2018-04-06 23:59:49,945 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_18| Int) (|v_main_#t~malloc13.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_17| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_17|))) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_18|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_18| 1) |v_main_#t~malloc13.base_17| 0) |v_main_#t~malloc14.base_18| 0)))))) is different from false [2018-04-06 23:59:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:50,286 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-06 23:59:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 23:59:50,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-04-06 23:59:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:50,288 INFO L225 Difference]: With dead ends: 163 [2018-04-06 23:59:50,288 INFO L226 Difference]: Without dead ends: 148 [2018-04-06 23:59:50,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 23:59:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-06 23:59:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-04-06 23:59:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-06 23:59:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2018-04-06 23:59:50,298 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 39 [2018-04-06 23:59:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:50,299 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2018-04-06 23:59:50,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 23:59:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2018-04-06 23:59:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 23:59:50,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:50,300 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:50,300 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash 808141238, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:50,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:50,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:50,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:50,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 23:59:50,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 23:59:50,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:50,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:50,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:50,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 23:59:50,392 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 23:59:50,396 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 23:59:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:50,400 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:50,417 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_20| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_20|))))) is different from false [2018-04-06 23:59:50,422 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_20| Int) (|v_main_#t~malloc13.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_19| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_19|))) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_20|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_20| 1) |v_main_#t~malloc13.base_19| 0) |v_main_#t~malloc14.base_20| 0))))) is different from false [2018-04-06 23:59:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:50,460 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:50,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 23:59:50,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 23:59:50,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 23:59:50,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 23:59:50,461 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand 12 states. [2018-04-06 23:59:50,469 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_20| Int) (|v_main_#t~malloc13.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_19| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_19|))) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_20|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_20| 1) |v_main_#t~malloc13.base_19| 0) |v_main_#t~malloc14.base_20| 0)))))) is different from false [2018-04-06 23:59:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:50,870 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-04-06 23:59:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 23:59:50,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-06 23:59:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:50,871 INFO L225 Difference]: With dead ends: 215 [2018-04-06 23:59:50,871 INFO L226 Difference]: Without dead ends: 200 [2018-04-06 23:59:50,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 23:59:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-06 23:59:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 141. [2018-04-06 23:59:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-06 23:59:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2018-04-06 23:59:50,879 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 40 [2018-04-06 23:59:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:50,879 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2018-04-06 23:59:50,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 23:59:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2018-04-06 23:59:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 23:59:50,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:50,881 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:50,881 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1546038517, 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-06 23:59:50,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:50,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:50,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:50,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 23:59:50,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 23:59:50,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:50,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:50,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:50,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 23:59:50,988 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 23:59:50,992 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 23:59:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:50,996 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:51,018 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_22| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_22| 0)) (not (= (select |c_#valid| |v_main_#t~malloc14.base_22|) 0)))) is different from false [2018-04-06 23:59:51,021 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0))))) is different from false [2018-04-06 23:59:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:51,065 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:51,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 23:59:51,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 23:59:51,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 23:59:51,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 23:59:51,065 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand 12 states. [2018-04-06 23:59:51,078 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0)))))) is different from false [2018-04-06 23:59:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:51,448 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-06 23:59:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 23:59:51,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-06 23:59:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:51,449 INFO L225 Difference]: With dead ends: 216 [2018-04-06 23:59:51,449 INFO L226 Difference]: Without dead ends: 201 [2018-04-06 23:59:51,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 23:59:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-06 23:59:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-04-06 23:59:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-06 23:59:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-04-06 23:59:51,459 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-04-06 23:59:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:51,459 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-04-06 23:59:51,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 23:59:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-04-06 23:59:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 23:59:51,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:51,460 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:51,460 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash 127115603, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:51,466 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:51,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:51,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:51,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 23:59:51,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 23:59:51,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:51,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:51,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:51,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 23:59:51,600 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 23:59:51,605 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 23:59:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:51,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:51,630 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_24| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_24| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc14.base_24|) 0)))) is different from false [2018-04-06 23:59:51,634 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) is different from false [2018-04-06 23:59:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:51,669 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:51,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 23:59:51,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 23:59:51,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 23:59:51,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 23:59:51,670 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-04-06 23:59:51,692 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 23:59:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:52,083 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-04-06 23:59:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 23:59:52,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-06 23:59:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:52,084 INFO L225 Difference]: With dead ends: 149 [2018-04-06 23:59:52,084 INFO L226 Difference]: Without dead ends: 134 [2018-04-06 23:59:52,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 23:59:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-06 23:59:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-04-06 23:59:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-06 23:59:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-06 23:59:52,094 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-04-06 23:59:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:52,095 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-06 23:59:52,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 23:59:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-06 23:59:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 23:59:52,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:52,096 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:52,096 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1969831352, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:52,105 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:52,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:52,126 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:52,151 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:52,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 23:59:52,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 23:59:52,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 23:59:52,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 23:59:52,152 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2018-04-06 23:59:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:52,167 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-04-06 23:59:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 23:59:52,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-04-06 23:59:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:52,168 INFO L225 Difference]: With dead ends: 121 [2018-04-06 23:59:52,168 INFO L226 Difference]: Without dead ends: 75 [2018-04-06 23:59:52,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-06 23:59:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-06 23:59:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-06 23:59:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-06 23:59:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-06 23:59:52,175 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 47 [2018-04-06 23:59:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:52,176 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-06 23:59:52,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 23:59:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-06 23:59:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 23:59:52,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:52,176 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:52,176 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash 255674758, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:52,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:52,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:52,247 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-06 23:59:52,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-06 23:59:52,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:52,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:52,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-06 23:59:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:52,294 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:52,366 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:52,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-04-06 23:59:52,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 23:59:52,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 23:59:52,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-06 23:59:52,367 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-04-06 23:59:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:52,453 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-06 23:59:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 23:59:52,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-06 23:59:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:52,454 INFO L225 Difference]: With dead ends: 128 [2018-04-06 23:59:52,454 INFO L226 Difference]: Without dead ends: 74 [2018-04-06 23:59:52,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-06 23:59:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-06 23:59:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-06 23:59:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-06 23:59:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-04-06 23:59:52,460 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 47 [2018-04-06 23:59:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:52,460 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-04-06 23:59:52,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 23:59:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-04-06 23:59:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 23:59:52,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:52,461 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:52,461 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 184048525, 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-06 23:59:52,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:52,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 23:59:52,522 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 23:59:52,548 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:52,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 23:59:52,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 23:59:52,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 23:59:52,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 23:59:52,549 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2018-04-06 23:59:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:52,609 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-04-06 23:59:52,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 23:59:52,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-06 23:59:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:52,610 INFO L225 Difference]: With dead ends: 78 [2018-04-06 23:59:52,610 INFO L226 Difference]: Without dead ends: 77 [2018-04-06 23:59:52,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 23:59:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-06 23:59:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-04-06 23:59:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-06 23:59:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-04-06 23:59:52,621 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 50 [2018-04-06 23:59:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:52,621 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-04-06 23:59:52,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 23:59:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-04-06 23:59:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 23:59:52,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:52,622 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:52,622 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash 184048526, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:52,629 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:52,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:52,673 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 14 treesize of output 11 [2018-04-06 23:59:52,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 23:59:52,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:52,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:52,684 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-06 23:59:52,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 23:59:52,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-06 23:59:52,742 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 14 treesize of output 11 [2018-04-06 23:59:52,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 23:59:52,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:52,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:52,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-04-06 23:59:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:52,837 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:53,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-06 23:59:53,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 29 treesize of output 25 [2018-04-06 23:59:53,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,038 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-06 23:59:53,047 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 5 treesize of output 3 [2018-04-06 23:59:53,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,057 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-06 23:59:53,066 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 5 treesize of output 3 [2018-04-06 23:59:53,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:53,075 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:57, output treesize:17 [2018-04-06 23:59:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:53,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 23:59:53,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-06 23:59:53,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-06 23:59:53,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-06 23:59:53,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-06 23:59:53,150 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 25 states. [2018-04-06 23:59:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:53,901 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-04-06 23:59:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 23:59:53,901 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-06 23:59:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:53,903 INFO L225 Difference]: With dead ends: 146 [2018-04-06 23:59:53,903 INFO L226 Difference]: Without dead ends: 145 [2018-04-06 23:59:53,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-04-06 23:59:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-06 23:59:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2018-04-06 23:59:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-06 23:59:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-04-06 23:59:53,917 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2018-04-06 23:59:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:53,917 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-04-06 23:59:53,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-06 23:59:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-04-06 23:59:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 23:59:53,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:53,918 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:53,918 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1530108069, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:53,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:53,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:53,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:53,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:53,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 23:59:54,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:54,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:54,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 23:59:54,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-06 23:59:54,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-04-06 23:59:54,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,035 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-06 23:59:54,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-04-06 23:59:54,047 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 13 treesize of output 11 [2018-04-06 23:59:54,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 23:59:54,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,061 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 25 treesize of output 26 [2018-04-06 23:59:54,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 23:59:54,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:54,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:42, output treesize:35 [2018-04-06 23:59:54,150 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 28 treesize of output 26 [2018-04-06 23:59:54,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 14 treesize of output 11 [2018-04-06 23:59:54,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 23:59:54,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 8 treesize of output 1 [2018-04-06 23:59:54,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:54,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 23:59:54,188 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-04-06 23:59:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:54,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:54,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 [2018-04-06 23:59:54,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,599 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 13 treesize of output 11 [2018-04-06 23:59:54,618 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 5 treesize of output 3 [2018-04-06 23:59:54,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:54,639 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-06 23:59:54,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-06 23:59:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:54,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 23:59:54,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-06 23:59:54,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-06 23:59:54,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-06 23:59:54,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=526, Unknown=2, NotChecked=0, Total=600 [2018-04-06 23:59:54,705 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 25 states. [2018-04-06 23:59:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:55,456 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2018-04-06 23:59:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 23:59:55,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-06 23:59:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:55,458 INFO L225 Difference]: With dead ends: 200 [2018-04-06 23:59:55,458 INFO L226 Difference]: Without dead ends: 199 [2018-04-06 23:59:55,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=1183, Unknown=4, NotChecked=0, Total=1406 [2018-04-06 23:59:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-06 23:59:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2018-04-06 23:59:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-06 23:59:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-06 23:59:55,479 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 50 [2018-04-06 23:59:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:55,479 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-06 23:59:55,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-06 23:59:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-06 23:59:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 23:59:55,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:55,480 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:55,480 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1530108070, 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-06 23:59:55,486 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:55,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 23:59:55,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 23:59:55,562 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:55,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 23:59:55,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 23:59:55,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 23:59:55,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 23:59:55,563 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 7 states. [2018-04-06 23:59:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:55,693 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-06 23:59:55,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 23:59:55,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-06 23:59:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:55,695 INFO L225 Difference]: With dead ends: 141 [2018-04-06 23:59:55,695 INFO L226 Difference]: Without dead ends: 140 [2018-04-06 23:59:55,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 23:59:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-06 23:59:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-04-06 23:59:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-06 23:59:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-04-06 23:59:55,715 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 50 [2018-04-06 23:59:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:55,715 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-04-06 23:59:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 23:59:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-04-06 23:59:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 23:59:55,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:55,716 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:55,716 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -645768457, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 23:59:55,725 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:55,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:55,786 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-06 23:59:55,787 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:55,801 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-06 23:59:55,822 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 23:59:55,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-06 23:59:55,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 23:59:55,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 23:59:55,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-06 23:59:55,823 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 8 states. [2018-04-06 23:59:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 23:59:55,902 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-06 23:59:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 23:59:55,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-04-06 23:59:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 23:59:55,903 INFO L225 Difference]: With dead ends: 140 [2018-04-06 23:59:55,903 INFO L226 Difference]: Without dead ends: 139 [2018-04-06 23:59:55,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-06 23:59:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-06 23:59:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-04-06 23:59:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-06 23:59:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-04-06 23:59:55,915 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 54 [2018-04-06 23:59:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 23:59:55,915 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-04-06 23:59:55,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 23:59:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-04-06 23:59:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 23:59:55,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 23:59:55,916 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 23:59:55,916 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-06 23:59:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -645768456, 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-06 23:59:55,921 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 23:59:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 23:59:55,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 23:59:55,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 23:59:55,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:55,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:55,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 23:59:55,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:55,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 23:59:55,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 23:59:55,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:55,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:55,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-06 23:59:55,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-04-06 23:59:55,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:55,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:55,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-04-06 23:59:56,007 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 13 treesize of output 11 [2018-04-06 23:59:56,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 23:59:56,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:56,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:56,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-06 23:59:56,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 23:59:56,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:56,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:56,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 23:59:56,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:42, output treesize:35 [2018-04-06 23:59:56,818 WARN L148 SmtUtils]: Spent 608ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-06 23:59:56,901 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 43 treesize of output 53 [2018-04-06 23:59:56,909 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 45 treesize of output 43 [2018-04-06 23:59:56,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 23:59:56,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-06 23:59:56,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 23:59:57,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 [2018-04-06 23:59:57,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 23:59:57,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-04-06 23:59:57,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-06 23:59:57,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-06 23:59:57,172 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-06 23:59:57,173 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,239 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 31 treesize of output 23 [2018-04-06 23:59:57,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,240 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 27 treesize of output 19 [2018-04-06 23:59:57,241 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-06 23:59:57,304 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 23:59:57,306 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 26 [2018-04-06 23:59:57,308 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:57,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-06 23:59:57,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 23:59:57,458 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-06 23:59:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:57,602 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 23:59:58,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 11 [2018-04-06 23:59:58,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-06 23:59:58,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-06 23:59:58,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,255 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 36 treesize of output 34 [2018-04-06 23:59:58,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 23:59:58,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-06 23:59:58,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 23:59:58,301 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,305 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,306 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 36 [2018-04-06 23:59:58,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-06 23:59:58,330 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,334 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,335 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 17 treesize of output 15 [2018-04-06 23:59:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 23:59:58,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,347 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 23:59:58,362 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-04-06 23:59:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 23:59:58,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 23:59:58,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-04-06 23:59:58,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-06 23:59:58,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-06 23:59:58,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1198, Unknown=7, NotChecked=0, Total=1332 [2018-04-06 23:59:58,424 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 37 states. [2018-04-07 00:00:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 00:00:01,372 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2018-04-07 00:00:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-07 00:00:01,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-04-07 00:00:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 00:00:01,373 INFO L225 Difference]: With dead ends: 187 [2018-04-07 00:00:01,373 INFO L226 Difference]: Without dead ends: 186 [2018-04-07 00:00:01,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=795, Invalid=4026, Unknown=9, NotChecked=0, Total=4830 [2018-04-07 00:00:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-07 00:00:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2018-04-07 00:00:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-07 00:00:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-04-07 00:00:01,389 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 54 [2018-04-07 00:00:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 00:00:01,389 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-04-07 00:00:01,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-07 00:00:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-04-07 00:00:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-07 00:00:01,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 00:00:01,391 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-07 00:00:01,391 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-07 00:00:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash -947537926, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 00:00:01,396 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 00:00:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 00:00:01,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 00:00:01,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 00:00:01,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:01,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:01,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 00:00:01,432 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 15 treesize of output 12 [2018-04-07 00:00:01,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 00:00:01,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:01,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:01,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:01,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-07 00:00:01,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-07 00:00:01,498 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 12 [2018-04-07 00:00:01,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-07 00:00:01,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-07 00:00:01,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-07 00:00:01,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-07 00:00:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 00:00:01,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 00:00:02,025 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 13 [2018-04-07 00:00:02,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-07 00:00:02,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:02,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:02,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-07 00:00:02,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-04-07 00:00:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 00:00:02,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 00:00:02,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-07 00:00:02,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-07 00:00:02,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-07 00:00:02,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-04-07 00:00:02,158 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 30 states. [2018-04-07 00:00:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 00:00:03,268 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-04-07 00:00:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-07 00:00:03,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-07 00:00:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 00:00:03,269 INFO L225 Difference]: With dead ends: 222 [2018-04-07 00:00:03,269 INFO L226 Difference]: Without dead ends: 221 [2018-04-07 00:00:03,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2018-04-07 00:00:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-07 00:00:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2018-04-07 00:00:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-07 00:00:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-07 00:00:03,282 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 68 [2018-04-07 00:00:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 00:00:03,282 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-07 00:00:03,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-07 00:00:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-07 00:00:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-07 00:00:03,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 00:00:03,283 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-04-07 00:00:03,283 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-07 00:00:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1644977820, now seen corresponding path program 2 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-07 00:00:03,289 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 00:00:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 00:00:03,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 00:00:03,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 00:00:03,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 00:00:03,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 00:00:03,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 00:00:03,374 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-07 00:00:03,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-07 00:00:03,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-04-07 00:00:03,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,406 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-07 00:00:03,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-04-07 00:00:03,429 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 29 [2018-04-07 00:00:03,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 00:00:03,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,445 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 13 treesize of output 11 [2018-04-07 00:00:03,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 00:00:03,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 00:00:03,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-07 00:00:03,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:42, output treesize:35 [2018-04-07 00:00:04,762 WARN L148 SmtUtils]: Spent 1118ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-07 00:00:07,261 WARN L148 SmtUtils]: Spent 2050ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-07 00:00:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 92 [2018-04-07 00:00:07,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 00:00:07,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 132 [2018-04-07 00:00:07,500 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-07 00:00:07,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 28 xjuncts. [2018-04-07 00:00:08,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-07 00:00:08,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-07 00:00:09,944 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-07 00:00:09,944 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-07 00:00:09,947 WARN L197 ceAbstractionStarter]: Timeout [2018-04-07 00:00:09,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:00:09 BasicIcfg [2018-04-07 00:00:09,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-07 00:00:09,948 INFO L168 Benchmark]: Toolchain (without parser) took 244095.86 ms. Allocated memory was 297.3 MB in the beginning and 537.9 MB in the end (delta: 240.6 MB). Free memory was 234.1 MB in the beginning and 221.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 318.6 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,948 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 297.3 MB. Free memory is still 259.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-07 00:00:09,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.69 ms. Allocated memory is still 297.3 MB. Free memory was 234.1 MB in the beginning and 210.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,949 INFO L168 Benchmark]: Boogie Preprocessor took 51.19 ms. Allocated memory is still 297.3 MB. Free memory was 210.2 MB in the beginning and 207.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,949 INFO L168 Benchmark]: RCFGBuilder took 532.70 ms. Allocated memory was 297.3 MB in the beginning and 449.8 MB in the end (delta: 152.6 MB). Free memory was 207.2 MB in the beginning and 382.9 MB in the end (delta: -175.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,949 INFO L168 Benchmark]: IcfgTransformer took 220092.10 ms. Allocated memory was 449.8 MB in the beginning and 590.9 MB in the end (delta: 141.0 MB). Free memory was 382.9 MB in the beginning and 323.2 MB in the end (delta: 59.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,949 INFO L168 Benchmark]: TraceAbstraction took 23109.07 ms. Allocated memory was 590.9 MB in the beginning and 537.9 MB in the end (delta: -53.0 MB). Free memory was 323.2 MB in the beginning and 221.7 MB in the end (delta: 101.5 MB). Peak memory consumption was 114.0 MB. Max. memory is 5.3 GB. [2018-04-07 00:00:09,952 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 297.3 MB. Free memory is still 259.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 305.69 ms. Allocated memory is still 297.3 MB. Free memory was 234.1 MB in the beginning and 210.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.19 ms. Allocated memory is still 297.3 MB. Free memory was 210.2 MB in the beginning and 207.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 532.70 ms. Allocated memory was 297.3 MB in the beginning and 449.8 MB in the end (delta: 152.6 MB). Free memory was 207.2 MB in the beginning and 382.9 MB in the end (delta: -175.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * IcfgTransformer took 220092.10 ms. Allocated memory was 449.8 MB in the beginning and 590.9 MB in the end (delta: 141.0 MB). Free memory was 382.9 MB in the beginning and 323.2 MB in the end (delta: 59.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23109.07 ms. Allocated memory was 590.9 MB in the beginning and 537.9 MB in the end (delta: -53.0 MB). Free memory was 323.2 MB in the beginning and 221.7 MB in the end (delta: 101.5 MB). Peak memory consumption was 114.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 85 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 1801 LocStat_NO_SUPPORTING_DISEQUALITIES : 368 LocStat_NO_DISJUNCTIONS : -170 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 106 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 117 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 113 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 21880.86 RENAME_VARIABLES(MILLISECONDS) : 1045.27 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 22054.90 PROJECTAWAY(MILLISECONDS) : 103732.58 ADD_WEAK_EQUALITY(MILLISECONDS) : 9.37 DISJOIN(MILLISECONDS) : 6158.11 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1080.50 ADD_EQUALITY(MILLISECONDS) : 10.60 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.56 #CONJOIN_DISJUNCTIVE : 835 #RENAME_VARIABLES : 1760 #UNFREEZE : 0 #CONJOIN : 1063 #PROJECTAWAY : 1023 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 504 #RENAME_VARIABLES_DISJUNCTIVE : 1698 #ADD_EQUALITY : 119 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 139654.31 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 22037.55 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 9.13 JOIN(MILLISECONDS) : 6126.47 RENAMEVARS(MILLISECONDS) : 1028.19 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 76833.37 ISLABELSTRONGERTHAN(MILLISECONDS) : 7127.29 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 1272.81 UNFREEZE(MILLISECONDS) : 463.65 REPORTCONTAINS(MILLISECONDS) : 0.93 PROJECTAWAY(MILLISECONDS) : 103377.74 MEETEDGELABELS(MILLISECONDS) : 2989.27 REPORTEQUALITY(MILLISECONDS) : 2965.45 ADDALLNODES(MILLISECONDS) : 1036.17 REPORTDISEQUALITY(MILLISECONDS) : 8.89 WEQGRAPHJOIN(MILLISECONDS) : 5793.86 #FREEZE : 8158 #ADDNODE : 0 #MEET : 739 #FILTERREDUNDANT : 0 #REPORTWEQ : 15 #JOIN : 504 #RENAMEVARS : 1760 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 2132 #ISLABELSTRONGERTHAN : 554151 #ISWEQGRAPHSTRONGERTHAN : 903 #UNFREEZE : 5145 #REPORTCONTAINS : 75 #PROJECTAWAY : 2646 #MEETEDGELABELS : 15970 #REPORTEQUALITY : 16844 #ADDALLNODES : 739 #REPORTDISEQUALITY : 3376 #WEQGRAPHJOIN : 504 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 37813.50 REPORT_EQUALITY(MILLISECONDS) : 14627.39 FILTERREDUNDANT(MILLISECONDS) : 138225.22 ADD_ALL_ELEMENTS(MILLISECONDS) : 47595.34 JOIN(MILLISECONDS) : 199.57 ALIGN_ELEMENTS(MILLISECONDS) : 94446.67 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 1611.70 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 156110.15 REPORTCONTAINS(MILLISECONDS) : 144.73 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 115181.63 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 7545.22 #ADDNODE : 0 #MEET : 91556 #REPORT_EQUALITY : 1927347 #FILTERREDUNDANT : 1218414 #ADD_ALL_ELEMENTS : 2009270 #JOIN : 504 #ALIGN_ELEMENTS : 954174 #COPY : 0 #REPORT_DISEQUALITY : 427747 #UNFREEZE : 0 #OVERALL : 8940935 #REPORTCONTAINS : 17953 #IS_STRONGER_THAN_NO_CACHING : 2203826 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 90144 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 73 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 609. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 15 error locations. TIMEOUT Result, 23.0s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1799 SDtfs, 4878 SDslu, 6780 SDs, 0 SdLazy, 4746 SolverSat, 168 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1926 GetRequests, 1531 SyntacticMatches, 20 SemanticMatches, 375 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=13, 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 524 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1746 ConstructedInterpolants, 176 QuantifiedInterpolants, 635611 SizeOfPredicates, 186 NumberOfNonLiveVariables, 2953 ConjunctsInSsa, 363 ConjunctsInUnsatCore, 46 InterpolantComputations, 38 PerfectInterpolantSequences, 30/92 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/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-07_00-00-09-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-07_00-00-09-962.csv Completed graceful shutdown