java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 22:14:26,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 22:14:26,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 22:14:26,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 22:14:26,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 22:14:26,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 22:14:26,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 22:14:26,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 22:14:26,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 22:14:26,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 22:14:26,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 22:14:26,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 22:14:26,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 22:14:26,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 22:14:26,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 22:14:26,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 22:14:26,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 22:14:26,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 22:14:26,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 22:14:26,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 22:14:26,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 22:14:26,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 22:14:26,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 22:14:26,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 22:14:26,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 22:14:26,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 22:14:26,399 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 22:14:26,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 22:14:26,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 22:14:26,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 22:14:26,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 22:14:26,402 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 22:14:26,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 22:14:26,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 22:14:26,425 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 22:14:26,425 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 22:14:26,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 22:14:26,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 22:14:26,426 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 22:14:26,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 22:14:26,426 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 22:14:26,426 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 22:14:26,426 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 22:14:26,427 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 22:14:26,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 22:14:26,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 22:14:26,427 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 22:14:26,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 22:14:26,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 22:14:26,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 22:14:26,428 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 22:14:26,428 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 22:14:26,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 22:14:26,428 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 22:14:26,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 22:14:26,429 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 22:14:26,429 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 22:14:26,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 22:14:26,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 22:14:26,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 22:14:26,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 22:14:26,431 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 22:14:26,431 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 22:14:26,431 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 22:14:26,432 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 22:14:26,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 22:14:26,473 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 22:14:26,477 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 22:14:26,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 22:14:26,478 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 22:14:26,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,765 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG562f73344 [2018-04-06 22:14:26,962 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 22:14:26,963 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 22:14:26,963 INFO L168 CDTParser]: Scanning sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,973 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 22:14:26,974 INFO L215 ultiparseSymbolTable]: [2018-04-06 22:14:26,974 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 22:14:26,974 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,974 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 22:14:26,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__register_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ushort in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uint in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ulong in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__size_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__div_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__SLL in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:26,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:27,006 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG562f73344 [2018-04-06 22:14:27,011 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 22:14:27,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 22:14:27,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 22:14:27,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 22:14:27,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 22:14:27,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45aaf92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27, skipping insertion in model container [2018-04-06 22:14:27,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,040 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 22:14:27,072 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 22:14:27,246 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 22:14:27,301 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 22:14:27,309 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-06 22:14:27,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27 WrapperNode [2018-04-06 22:14:27,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 22:14:27,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 22:14:27,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 22:14:27,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 22:14:27,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (1/1) ... [2018-04-06 22:14:27,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 22:14:27,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 22:14:27,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 22:14:27,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 22:14:27,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (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 22:14:27,558 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 22:14:27,559 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 22:14:27,559 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 22:14:27,559 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 22:14:27,559 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 22:14:27,559 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 22:14:27,560 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 22:14:27,561 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 22:14:27,562 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 22:14:27,563 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 22:14:27,564 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 22:14:27,565 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 22:14:27,566 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 22:14:27,567 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 22:14:27,568 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 22:14:27,569 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 22:14:27,570 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-06 22:14:27,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 22:14:27,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 22:14:27,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 22:14:27,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 22:14:27,572 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 22:14:28,144 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 22:14:28,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:14:28 BoogieIcfgContainer [2018-04-06 22:14:28,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 22:14:28,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 22:14:28,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 22:14:28,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 22:14:28,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:14:27" (1/3) ... [2018-04-06 22:14:28,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71462401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:14:28, skipping insertion in model container [2018-04-06 22:14:28,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:14:27" (2/3) ... [2018-04-06 22:14:28,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71462401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:14:28, skipping insertion in model container [2018-04-06 22:14:28,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:14:28" (3/3) ... [2018-04-06 22:14:28,151 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-06 22:14:28,158 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 22:14:28,165 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-06 22:14:28,204 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 22:14:28,205 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 22:14:28,205 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 22:14:28,205 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 22:14:28,205 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 22:14:28,205 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 22:14:28,205 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 22:14:28,205 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 22:14:28,206 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 22:14:28,206 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 22:14:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-04-06 22:14:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 22:14:28,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:28,229 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:28,229 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -550235571, 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 22:14:28,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:28,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:28,321 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 22:14:28,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:28,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:28,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 22:14:28,370 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 22:14:28,370 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:28,377 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 22:14:28,400 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:28,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 22:14:28,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 22:14:28,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 22:14:28,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 22:14:28,415 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 4 states. [2018-04-06 22:14:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:28,695 INFO L93 Difference]: Finished difference Result 303 states and 336 transitions. [2018-04-06 22:14:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 22:14:28,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-06 22:14:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:28,711 INFO L225 Difference]: With dead ends: 303 [2018-04-06 22:14:28,711 INFO L226 Difference]: Without dead ends: 195 [2018-04-06 22:14:28,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 22:14:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-06 22:14:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-04-06 22:14:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-06 22:14:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2018-04-06 22:14:28,766 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 9 [2018-04-06 22:14:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:28,766 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2018-04-06 22:14:28,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 22:14:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2018-04-06 22:14:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 22:14:28,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:28,767 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:28,767 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash -550235570, 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 22:14:28,779 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:28,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:28,805 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 22:14:28,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:28,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:28,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 22:14:28,822 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 22:14:28,822 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:28,863 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 22:14:28,897 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:28,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 22:14:28,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 22:14:28,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 22:14:28,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 22:14:28,900 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand 6 states. [2018-04-06 22:14:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:29,134 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-04-06 22:14:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 22:14:29,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-06 22:14:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:29,136 INFO L225 Difference]: With dead ends: 171 [2018-04-06 22:14:29,136 INFO L226 Difference]: Without dead ends: 163 [2018-04-06 22:14:29,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 22:14:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-06 22:14:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2018-04-06 22:14:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-06 22:14:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2018-04-06 22:14:29,150 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 9 [2018-04-06 22:14:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:29,151 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2018-04-06 22:14:29,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 22:14:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2018-04-06 22:14:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-06 22:14:29,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:29,152 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:29,153 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:29,153 INFO L82 PathProgramCache]: Analyzing trace with hash -646325675, 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 22:14:29,163 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:29,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:29,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 22:14:29,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 22:14:29,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:29,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:29,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-06 22:14:29,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 22:14:29,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-06 22:14:29,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,270 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 22:14:29,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-06 22:14:29,276 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 22:14:29,276 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:29,281 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 22:14:29,302 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:29,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 22:14:29,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 22:14:29,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 22:14:29,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 22:14:29,303 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 5 states. [2018-04-06 22:14:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:29,724 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2018-04-06 22:14:29,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 22:14:29,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-06 22:14:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:29,727 INFO L225 Difference]: With dead ends: 340 [2018-04-06 22:14:29,727 INFO L226 Difference]: Without dead ends: 339 [2018-04-06 22:14:29,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-06 22:14:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 156. [2018-04-06 22:14:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-06 22:14:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-06 22:14:29,743 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 17 [2018-04-06 22:14:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:29,744 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-06 22:14:29,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 22:14:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-06 22:14:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-06 22:14:29,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:29,745 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:29,745 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash -646325674, 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 22:14:29,751 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:29,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:29,770 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 22:14:29,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 22:14:29,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:29,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:29,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:29,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:29,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-06 22:14:29,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 22:14:29,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-06 22:14:29,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-06 22:14:29,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-06 22:14:29,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:29,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-06 22:14:29,875 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 22:14:29,875 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:29,902 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 22:14:29,923 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:29,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 22:14:29,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 22:14:29,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 22:14:29,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:29,924 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 8 states. [2018-04-06 22:14:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:30,237 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-04-06 22:14:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 22:14:30,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-06 22:14:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:30,238 INFO L225 Difference]: With dead ends: 284 [2018-04-06 22:14:30,239 INFO L226 Difference]: Without dead ends: 283 [2018-04-06 22:14:30,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-06 22:14:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-06 22:14:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 155. [2018-04-06 22:14:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-06 22:14:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-04-06 22:14:30,250 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 17 [2018-04-06 22:14:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:30,250 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-04-06 22:14:30,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 22:14:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-04-06 22:14:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 22:14:30,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:30,251 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:30,251 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 955719731, 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 22:14:30,259 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:30,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:30,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:30,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:30,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 22:14:30,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:30,290 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 22:14:30,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-06 22:14:30,300 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 22:14:30,301 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:30,350 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 22:14:30,371 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:30,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 22:14:30,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 22:14:30,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 22:14:30,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 22:14:30,372 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 7 states. [2018-04-06 22:14:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:30,617 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-04-06 22:14:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 22:14:30,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-06 22:14:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:30,619 INFO L225 Difference]: With dead ends: 231 [2018-04-06 22:14:30,619 INFO L226 Difference]: Without dead ends: 215 [2018-04-06 22:14:30,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-06 22:14:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-06 22:14:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 153. [2018-04-06 22:14:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-06 22:14:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-04-06 22:14:30,632 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 24 [2018-04-06 22:14:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:30,633 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-04-06 22:14:30,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 22:14:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-04-06 22:14:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 22:14:30,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:30,634 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:30,634 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 955719732, 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 22:14:30,641 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:30,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:30,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:30,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:30,697 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 22:14:30,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:30,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 22:14:30,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:30,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:30,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-06 22:14:30,736 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 22:14:30,736 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:30,816 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 22:14:30,838 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:30,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 22:14:30,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 22:14:30,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 22:14:30,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:30,839 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 8 states. [2018-04-06 22:14:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:31,133 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2018-04-06 22:14:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 22:14:31,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-06 22:14:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:31,134 INFO L225 Difference]: With dead ends: 211 [2018-04-06 22:14:31,134 INFO L226 Difference]: Without dead ends: 207 [2018-04-06 22:14:31,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-06 22:14:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-06 22:14:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 175. [2018-04-06 22:14:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-06 22:14:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-04-06 22:14:31,143 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 24 [2018-04-06 22:14:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:31,144 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-04-06 22:14:31,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 22:14:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-04-06 22:14:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-06 22:14:31,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:31,145 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] [2018-04-06 22:14:31,145 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2110353715, 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 22:14:31,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:31,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:31,190 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 22:14:31,191 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:31,212 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 22:14:31,234 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:31,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 7 [2018-04-06 22:14:31,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 22:14:31,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 22:14:31,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:31,235 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 8 states. [2018-04-06 22:14:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:31,484 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2018-04-06 22:14:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 22:14:31,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-06 22:14:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:31,485 INFO L225 Difference]: With dead ends: 228 [2018-04-06 22:14:31,485 INFO L226 Difference]: Without dead ends: 221 [2018-04-06 22:14:31,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-04-06 22:14:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-06 22:14:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 185. [2018-04-06 22:14:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-06 22:14:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2018-04-06 22:14:31,497 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 27 [2018-04-06 22:14:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:31,497 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2018-04-06 22:14:31,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 22:14:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2018-04-06 22:14:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 22:14:31,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:31,499 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:31,499 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1421333449, 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 22:14:31,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:31,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:31,544 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 22:14:31,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 22:14:31,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 22:14:31,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:31,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-06 22:14:31,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-06 22:14:31,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-06 22:14:31,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,597 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 22:14:31,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-06 22:14:31,626 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 22:14:31,626 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:31,633 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 22:14:31,665 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:31,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 22:14:31,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 22:14:31,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 22:14:31,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 22:14:31,666 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand 6 states. [2018-04-06 22:14:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:31,869 INFO L93 Difference]: Finished difference Result 282 states and 315 transitions. [2018-04-06 22:14:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 22:14:31,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-06 22:14:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:31,871 INFO L225 Difference]: With dead ends: 282 [2018-04-06 22:14:31,871 INFO L226 Difference]: Without dead ends: 281 [2018-04-06 22:14:31,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-06 22:14:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-06 22:14:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 184. [2018-04-06 22:14:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-06 22:14:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2018-04-06 22:14:31,885 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 28 [2018-04-06 22:14:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:31,886 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2018-04-06 22:14:31,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 22:14:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2018-04-06 22:14:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 22:14:31,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:31,887 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:31,887 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1421333448, 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 22:14:31,897 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:31,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:31,926 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 22:14:31,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 22:14:31,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 22:14:31,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:31,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 22:14:31,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:31,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:31,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-06 22:14:32,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-06 22:14:32,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-06 22:14:32,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,020 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 22:14:32,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 11 treesize of output 3 [2018-04-06 22:14:32,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-06 22:14:32,035 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 22:14:32,035 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:32,074 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 22:14:32,094 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:32,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-06 22:14:32,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 22:14:32,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 22:14:32,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-06 22:14:32,095 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 10 states. [2018-04-06 22:14:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:32,413 INFO L93 Difference]: Finished difference Result 310 states and 348 transitions. [2018-04-06 22:14:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 22:14:32,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-04-06 22:14:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:32,414 INFO L225 Difference]: With dead ends: 310 [2018-04-06 22:14:32,414 INFO L226 Difference]: Without dead ends: 302 [2018-04-06 22:14:32,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-06 22:14:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-06 22:14:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 176. [2018-04-06 22:14:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-06 22:14:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-04-06 22:14:32,427 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 28 [2018-04-06 22:14:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:32,427 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-04-06 22:14:32,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 22:14:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-04-06 22:14:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-06 22:14:32,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:32,428 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] [2018-04-06 22:14:32,428 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -165448528, 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 22:14:32,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:32,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:32,470 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 22:14:32,471 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:32,484 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 22:14:32,506 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:32,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 22:14:32,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 22:14:32,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 22:14:32,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 22:14:32,507 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 5 states. [2018-04-06 22:14:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:32,621 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-04-06 22:14:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 22:14:32,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-06 22:14:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:32,622 INFO L225 Difference]: With dead ends: 250 [2018-04-06 22:14:32,622 INFO L226 Difference]: Without dead ends: 200 [2018-04-06 22:14:32,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 22:14:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-06 22:14:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2018-04-06 22:14:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-06 22:14:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2018-04-06 22:14:32,630 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 30 [2018-04-06 22:14:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:32,631 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2018-04-06 22:14:32,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 22:14:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2018-04-06 22:14:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-06 22:14:32,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:32,632 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:32,632 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash -60387487, 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 22:14:32,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:32,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:32,720 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 22:14:32,720 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:32,726 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 22:14:32,761 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:32,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 22:14:32,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 22:14:32,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 22:14:32,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 22:14:32,762 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand 4 states. [2018-04-06 22:14:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:32,786 INFO L93 Difference]: Finished difference Result 326 states and 363 transitions. [2018-04-06 22:14:32,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 22:14:32,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-06 22:14:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:32,787 INFO L225 Difference]: With dead ends: 326 [2018-04-06 22:14:32,787 INFO L226 Difference]: Without dead ends: 220 [2018-04-06 22:14:32,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 22:14:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-06 22:14:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 180. [2018-04-06 22:14:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-06 22:14:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-04-06 22:14:32,798 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 33 [2018-04-06 22:14:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:32,798 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-04-06 22:14:32,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 22:14:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-04-06 22:14:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 22:14:32,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:32,799 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] [2018-04-06 22:14:32,799 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:32,799 INFO L82 PathProgramCache]: Analyzing trace with hash 860124670, 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 22:14:32,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:32,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:32,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:32,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:32,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-06 22:14:32,932 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 22:14:32,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-06 22:14:32,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:32,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-06 22:14:32,959 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 22:14:32,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:33,042 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 22:14:33,078 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:33,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2018-04-06 22:14:33,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 22:14:33,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 22:14:33,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-06 22:14:33,079 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 11 states. [2018-04-06 22:14:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:33,430 INFO L93 Difference]: Finished difference Result 355 states and 387 transitions. [2018-04-06 22:14:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 22:14:33,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-06 22:14:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:33,432 INFO L225 Difference]: With dead ends: 355 [2018-04-06 22:14:33,432 INFO L226 Difference]: Without dead ends: 354 [2018-04-06 22:14:33,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-04-06 22:14:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-06 22:14:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2018-04-06 22:14:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-06 22:14:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2018-04-06 22:14:33,449 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 35 [2018-04-06 22:14:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:33,449 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2018-04-06 22:14:33,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 22:14:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2018-04-06 22:14:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 22:14:33,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:33,451 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] [2018-04-06 22:14:33,451 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 860124671, 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 22:14:33,460 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:33,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:33,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:33,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:33,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-06 22:14:33,514 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 22:14:33,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-06 22:14:33,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:33,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-06 22:14:33,527 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 22:14:33,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:33,556 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 22:14:33,577 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:33,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 11 [2018-04-06 22:14:33,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 22:14:33,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 22:14:33,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-06 22:14:33,578 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand 11 states. [2018-04-06 22:14:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:34,018 INFO L93 Difference]: Finished difference Result 617 states and 680 transitions. [2018-04-06 22:14:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-06 22:14:34,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-06 22:14:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:34,021 INFO L225 Difference]: With dead ends: 617 [2018-04-06 22:14:34,021 INFO L226 Difference]: Without dead ends: 499 [2018-04-06 22:14:34,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2018-04-06 22:14:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-06 22:14:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 210. [2018-04-06 22:14:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-06 22:14:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2018-04-06 22:14:34,042 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 35 [2018-04-06 22:14:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:34,043 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2018-04-06 22:14:34,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 22:14:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2018-04-06 22:14:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 22:14:34,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:34,044 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 22:14:34,044 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314881, 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 22:14:34,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:34,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:34,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:34,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 22:14:34,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-06 22:14:34,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:34,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:34,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-06 22:14:34,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-06 22:14:34,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:34,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,209 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 22:14:34,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-06 22:14:34,262 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 36 treesize of output 24 [2018-04-06 22:14:34,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-06 22:14:34,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 22:14:34,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:34,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:15 [2018-04-06 22:14:34,295 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 22:14:34,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:34,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-06 22:14:34,386 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 22:14:34,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 22:14:34,402 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 22:14:34,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-06 22:14:34,409 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 18 treesize of output 5 [2018-04-06 22:14:34,409 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 22:14:34,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:14:34,438 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-06 22:14:34,480 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:34,480 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:25, output treesize:1 [2018-04-06 22:14:34,485 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 22:14:34,507 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:34,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-06 22:14:34,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 22:14:34,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 22:14:34,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-06 22:14:34,508 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand 18 states. [2018-04-06 22:14:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:35,982 INFO L93 Difference]: Finished difference Result 633 states and 691 transitions. [2018-04-06 22:14:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 22:14:36,020 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-06 22:14:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:36,023 INFO L225 Difference]: With dead ends: 633 [2018-04-06 22:14:36,023 INFO L226 Difference]: Without dead ends: 632 [2018-04-06 22:14:36,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2018-04-06 22:14:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-04-06 22:14:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 227. [2018-04-06 22:14:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-06 22:14:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 253 transitions. [2018-04-06 22:14:36,046 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 253 transitions. Word has length 36 [2018-04-06 22:14:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:36,046 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 253 transitions. [2018-04-06 22:14:36,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 22:14:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 253 transitions. [2018-04-06 22:14:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 22:14:36,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:36,047 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 22:14:36,047 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314880, 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 22:14:36,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:36,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:36,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:36,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:36,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 22:14:36,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 22:14:36,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-06 22:14:36,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:36,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:36,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:36,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:36,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-06 22:14:36,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-06 22:14:36,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:36,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-06 22:14:36,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:36,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:36,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-06 22:14:36,323 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 47 treesize of output 33 [2018-04-06 22:14:36,326 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 28 treesize of output 17 [2018-04-06 22:14:36,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 22:14:36,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,373 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 22 treesize of output 20 [2018-04-06 22:14:36,376 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 22:14:36,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 22:14:36,393 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,398 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9 [2018-04-06 22:14:36,414 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 22:14:36,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:36,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-04-06 22:14:36,546 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 22:14:36,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,562 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 58 treesize of output 54 [2018-04-06 22:14:36,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-04-06 22:14:36,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 22:14:36,573 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 22:14:36,573 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 22:14:36,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-06 22:14:36,640 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 22:14:36,640 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-06 22:14:36,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-06 22:14:36,657 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,659 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-04-06 22:14:36,696 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 22:14:36,697 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,702 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 24 treesize of output 20 [2018-04-06 22:14:36,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-06 22:14:36,705 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,706 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,709 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-06 22:14:36,729 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 22:14:36,729 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,735 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 10 treesize of output 8 [2018-04-06 22:14:36,736 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 22:14:36,736 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,737 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,741 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-06 22:14:36,772 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 22:14:36,772 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 22:14:36,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-06 22:14:36,781 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,782 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,786 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:14:36,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 22:14:36,804 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:113, output treesize:39 [2018-04-06 22:14:36,839 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 22:14:36,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-06 22:14:36,857 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 22:14:36,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:36,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-04-06 22:14:36,865 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 22:14:36,886 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:36,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-06 22:14:36,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 22:14:36,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 22:14:36,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-04-06 22:14:36,887 INFO L87 Difference]: Start difference. First operand 227 states and 253 transitions. Second operand 18 states. [2018-04-06 22:14:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:38,168 INFO L93 Difference]: Finished difference Result 616 states and 672 transitions. [2018-04-06 22:14:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-06 22:14:38,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-06 22:14:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:38,170 INFO L225 Difference]: With dead ends: 616 [2018-04-06 22:14:38,171 INFO L226 Difference]: Without dead ends: 615 [2018-04-06 22:14:38,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2018-04-06 22:14:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-04-06 22:14:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 227. [2018-04-06 22:14:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-06 22:14:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 252 transitions. [2018-04-06 22:14:38,193 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 252 transitions. Word has length 36 [2018-04-06 22:14:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:38,193 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 252 transitions. [2018-04-06 22:14:38,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 22:14:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 252 transitions. [2018-04-06 22:14:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 22:14:38,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:38,194 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 22:14:38,195 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:38,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1113365695, 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 22:14:38,204 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:38,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:38,232 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 22:14:38,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 22:14:38,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:38,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:38,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-06 22:14:38,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 22:14:38,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-06 22:14:38,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,284 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 22:14:38,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-06 22:14:38,288 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 22:14:38,289 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:38,294 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 22:14:38,315 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:38,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 22:14:38,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 22:14:38,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 22:14:38,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 22:14:38,315 INFO L87 Difference]: Start difference. First operand 227 states and 252 transitions. Second operand 5 states. [2018-04-06 22:14:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:38,513 INFO L93 Difference]: Finished difference Result 368 states and 408 transitions. [2018-04-06 22:14:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 22:14:38,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-06 22:14:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:38,515 INFO L225 Difference]: With dead ends: 368 [2018-04-06 22:14:38,515 INFO L226 Difference]: Without dead ends: 367 [2018-04-06 22:14:38,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-06 22:14:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 226. [2018-04-06 22:14:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-06 22:14:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 251 transitions. [2018-04-06 22:14:38,537 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 251 transitions. Word has length 36 [2018-04-06 22:14:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:38,537 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 251 transitions. [2018-04-06 22:14:38,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 22:14:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 251 transitions. [2018-04-06 22:14:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 22:14:38,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:38,538 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 22:14:38,538 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1113365696, 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 22:14:38,550 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:38,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:38,573 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 22:14:38,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 22:14:38,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:38,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:38,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:38,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-06 22:14:38,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 22:14:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-06 22:14:38,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-06 22:14:38,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-06 22:14:38,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:38,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-06 22:14:38,654 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 22:14:38,654 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:38,681 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 22:14:38,703 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:38,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 22:14:38,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 22:14:38,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 22:14:38,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-06 22:14:38,703 INFO L87 Difference]: Start difference. First operand 226 states and 251 transitions. Second operand 8 states. [2018-04-06 22:14:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:38,943 INFO L93 Difference]: Finished difference Result 372 states and 414 transitions. [2018-04-06 22:14:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 22:14:38,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-06 22:14:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:38,945 INFO L225 Difference]: With dead ends: 372 [2018-04-06 22:14:38,945 INFO L226 Difference]: Without dead ends: 371 [2018-04-06 22:14:38,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-06 22:14:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-06 22:14:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 225. [2018-04-06 22:14:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-06 22:14:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-04-06 22:14:38,967 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 36 [2018-04-06 22:14:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:38,967 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-04-06 22:14:38,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 22:14:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-04-06 22:14:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 22:14:38,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:38,969 INFO L355 BasicCegarLoop]: trace histogram [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 22:14:38,969 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 753877800, 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 22:14:38,980 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:38,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:39,005 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:39,030 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 22:14:39,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 22:14:39,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 22:14:39,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 22:14:39,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 22:14:39,031 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 4 states. [2018-04-06 22:14:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:39,049 INFO L93 Difference]: Finished difference Result 345 states and 381 transitions. [2018-04-06 22:14:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 22:14:39,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-06 22:14:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:39,050 INFO L225 Difference]: With dead ends: 345 [2018-04-06 22:14:39,050 INFO L226 Difference]: Without dead ends: 244 [2018-04-06 22:14:39,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 22:14:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-06 22:14:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 229. [2018-04-06 22:14:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-06 22:14:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2018-04-06 22:14:39,069 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 50 [2018-04-06 22:14:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:39,070 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2018-04-06 22:14:39,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 22:14:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2018-04-06 22:14:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 22:14:39,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:39,071 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:39,071 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1430642435, 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 22:14:39,084 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:39,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:39,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 22:14:39,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:39,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 22:14:39,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:39,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-06 22:14:39,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 22:14:39,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 22:14:39,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 22:14:39,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 22:14:39,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-06 22:14:39,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-06 22:14:39,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-06 22:14:39,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-06 22:14:39,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-06 22:14:39,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-04-06 22:14:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:39,233 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:39,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 22:14:39,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-04-06 22:14:39,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 22:14:39,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 22:14:39,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-06 22:14:39,287 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand 11 states. [2018-04-06 22:14:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:39,663 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2018-04-06 22:14:39,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 22:14:39,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-06 22:14:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:39,664 INFO L225 Difference]: With dead ends: 443 [2018-04-06 22:14:39,664 INFO L226 Difference]: Without dead ends: 351 [2018-04-06 22:14:39,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-04-06 22:14:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-06 22:14:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 264. [2018-04-06 22:14:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-06 22:14:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 291 transitions. [2018-04-06 22:14:39,680 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 291 transitions. Word has length 52 [2018-04-06 22:14:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:39,681 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 291 transitions. [2018-04-06 22:14:39,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 22:14:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 291 transitions. [2018-04-06 22:14:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 22:14:39,681 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:39,681 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:39,681 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1631727874, 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 22:14:39,688 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:39,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:39,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 22:14:39,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-06 22:14:39,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:39,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:39,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-06 22:14:39,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-06 22:14:39,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:39,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,833 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 22:14:39,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-06 22:14:39,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-06 22:14:39,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,892 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 22:14:39,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-06 22:14:39,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-06 22:14:39,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:39,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-06 22:14:39,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:39,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:39,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-06 22:14:40,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:40,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 98 [2018-04-06 22:14:40,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:40,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,191 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 22:14:40,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:80 [2018-04-06 22:14:40,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2018-04-06 22:14:40,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:40,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-06 22:14:40,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:40,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2018-04-06 22:14:40,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 64 [2018-04-06 22:14:40,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:40,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-04-06 22:14:40,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 22:14:40,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-04-06 22:14:40,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:40,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:40,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:40,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:28 [2018-04-06 22:14:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:40,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:40,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 87 [2018-04-06 22:14:40,942 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 22:14:40,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:40,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 80 [2018-04-06 22:14:40,967 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 66 treesize of output 65 [2018-04-06 22:14:40,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:41,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-06 22:14:41,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-04-06 22:14:41,099 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 33 [2018-04-06 22:14:41,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,116 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,117 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 41 treesize of output 36 [2018-04-06 22:14:41,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-06 22:14:41,119 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,127 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 17 [2018-04-06 22:14:41,127 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-04-06 22:14:41,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-06 22:14:41,205 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-06 22:14:41,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:14:41,222 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 29 treesize of output 19 [2018-04-06 22:14:41,222 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,226 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,231 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:41,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:14:41,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:14:41,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 22:14:41,257 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:168, output treesize:47 [2018-04-06 22:14:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:41,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 22:14:41,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-04-06 22:14:41,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-06 22:14:41,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-06 22:14:41,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=800, Unknown=1, NotChecked=0, Total=992 [2018-04-06 22:14:41,386 INFO L87 Difference]: Start difference. First operand 264 states and 291 transitions. Second operand 32 states. [2018-04-06 22:14:44,677 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 81 DAG size of output 63 [2018-04-06 22:14:44,896 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 79 DAG size of output 77 [2018-04-06 22:14:50,057 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 76 DAG size of output 58 [2018-04-06 22:14:50,531 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 86 DAG size of output 68 [2018-04-06 22:14:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:14:51,110 INFO L93 Difference]: Finished difference Result 1012 states and 1087 transitions. [2018-04-06 22:14:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-06 22:14:51,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-04-06 22:14:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:14:51,147 INFO L225 Difference]: With dead ends: 1012 [2018-04-06 22:14:51,147 INFO L226 Difference]: Without dead ends: 1011 [2018-04-06 22:14:51,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3615 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2422, Invalid=8707, Unknown=1, NotChecked=0, Total=11130 [2018-04-06 22:14:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-04-06 22:14:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 299. [2018-04-06 22:14:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-06 22:14:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2018-04-06 22:14:51,186 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 54 [2018-04-06 22:14:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:14:51,186 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2018-04-06 22:14:51,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-06 22:14:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2018-04-06 22:14:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 22:14:51,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 22:14:51,188 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 22:14:51,188 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 22:14:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1631727873, 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 22:14:51,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 22:14:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 22:14:51,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 22:14:51,246 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 22:14:51,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 22:14:51,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-06 22:14:51,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:51,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:51,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 22:14:51,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 22:14:51,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-06 22:14:51,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-06 22:14:51,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:51,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,451 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 33 treesize of output 34 [2018-04-06 22:14:51,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 22:14:51,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:51,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-06 22:14:51,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 22:14:51,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-06 22:14:51,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:51,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-06 22:14:51,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-04-06 22:14:51,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 22:14:51,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-04-06 22:14:51,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-04-06 22:14:51,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:51,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:97 [2018-04-06 22:14:51,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-06 22:14:51,800 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-06 22:14:51,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:51,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 122 [2018-04-06 22:14:51,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 22:14:51,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:51,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:51,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:120, output treesize:108 [2018-04-06 22:14:52,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 74 [2018-04-06 22:14:52,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:52,030 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 20 treesize of output 31 [2018-04-06 22:14:52,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-06 22:14:52,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:52,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-06 22:14:52,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:52,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:143 [2018-04-06 22:14:52,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 93 [2018-04-06 22:14:52,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:52,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-04-06 22:14:52,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,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 5 treesize of output 1 [2018-04-06 22:14:52,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,319 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-04-06 22:14:52,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:52,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:52,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-06 22:14:52,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 22:14:52,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 22:14:52,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 22:14:52,359 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-06 22:14:52,364 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:14:52,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 22:14:52,376 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:142, output treesize:18 [2018-04-06 22:14:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:14:52,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 22:14:59,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 248 [2018-04-06 22:14:59,825 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 22:14:59,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:59,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 229 [2018-04-06 22:14:59,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 215 treesize of output 214 [2018-04-06 22:14:59,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 22:14:59,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 214 treesize of output 222 [2018-04-06 22:14:59,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-06 22:14:59,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 202 [2018-04-06 22:15:00,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-04-06 22:15:00,023 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 176 [2018-04-06 22:15:00,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,049 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 172 [2018-04-06 22:15:00,050 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 204 [2018-04-06 22:15:00,098 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,107 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 3 case distinctions, treesize of input 24 treesize of output 46 [2018-04-06 22:15:00,107 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,138 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 186 treesize of output 180 [2018-04-06 22:15:00,141 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,141 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,142 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 176 treesize of output 166 [2018-04-06 22:15:00,142 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,151 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,153 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 190 treesize of output 182 [2018-04-06 22:15:00,158 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,171 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 182 treesize of output 184 [2018-04-06 22:15:00,172 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-06 22:15:00,210 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:00,234 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 220 [2018-04-06 22:15:00,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 367 treesize of output 395 [2018-04-06 22:15:00,435 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,437 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 22:15:00,437 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 227 [2018-04-06 22:15:00,467 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 221 [2018-04-06 22:15:00,604 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,706 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,717 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 3 case distinctions, treesize of input 191 treesize of output 213 [2018-04-06 22:15:00,717 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:00,840 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 194 treesize of output 186 [2018-04-06 22:15:00,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,857 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 182 treesize of output 184 [2018-04-06 22:15:00,858 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-06 22:15:00,914 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:00,916 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 190 treesize of output 184 [2018-04-06 22:15:00,918 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,919 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:00,920 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 176 treesize of output 166 [2018-04-06 22:15:00,920 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:00,932 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 196 [2018-04-06 22:15:01,067 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 191 treesize of output 185 [2018-04-06 22:15:01,068 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 171 [2018-04-06 22:15:01,104 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 172 [2018-04-06 22:15:01,133 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,156 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 202 [2018-04-06 22:15:01,173 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 181 [2018-04-06 22:15:01,191 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-04-06 22:15:01,250 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 184 [2018-04-06 22:15:01,252 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,307 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 179 treesize of output 171 [2018-04-06 22:15:01,307 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,353 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 22:15:01,435 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:01,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:01,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 94 [2018-04-06 22:15:01,597 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 22:15:01,598 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 75 [2018-04-06 22:15:01,627 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 61 treesize of output 60 [2018-04-06 22:15:01,628 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 75 [2018-04-06 22:15:01,658 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2018-04-06 22:15:01,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 81 [2018-04-06 22:15:01,774 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 67 [2018-04-06 22:15:01,785 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,786 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 22:15:01,786 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 76 [2018-04-06 22:15:01,875 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-04-06 22:15:01,948 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,949 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 25 treesize of output 15 [2018-04-06 22:15:01,949 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:01,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,963 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:01,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-06 22:15:01,968 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:01,985 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:02,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2018-04-06 22:15:02,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,033 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-06 22:15:02,037 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,061 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 25 [2018-04-06 22:15:02,061 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2018-04-06 22:15:02,078 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,090 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 22:15:02,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-06 22:15:02,114 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2018-04-06 22:15:02,115 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,119 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,129 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,157 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,167 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 111 [2018-04-06 22:15:02,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 22:15:02,230 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 63 [2018-04-06 22:15:02,252 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 18 treesize of output 15 [2018-04-06 22:15:02,252 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-04-06 22:15:02,275 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 22 [2018-04-06 22:15:02,277 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-06 22:15:02,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-06 22:15:02,293 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,296 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,298 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,299 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,305 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 104 [2018-04-06 22:15:02,312 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 22:15:02,312 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2018-04-06 22:15:02,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 22:15:02,330 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-04-06 22:15:02,361 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-04-06 22:15:02,363 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,377 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 43 treesize of output 38 [2018-04-06 22:15:02,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-06 22:15:02,379 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-04-06 22:15:02,387 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,391 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,392 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,393 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,398 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 106 [2018-04-06 22:15:02,405 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 22:15:02,405 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 82 [2018-04-06 22:15:02,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-06 22:15:02,441 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,489 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 67 treesize of output 73 [2018-04-06 22:15:02,490 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-06 22:15:02,544 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 42 [2018-04-06 22:15:02,553 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,578 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 43 treesize of output 35 [2018-04-06 22:15:02,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2018-04-06 22:15:02,612 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,631 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-06 22:15:02,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,637 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 29 treesize of output 16 [2018-04-06 22:15:02,637 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,642 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,651 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 73 [2018-04-06 22:15:02,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-04-06 22:15:02,762 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,764 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 22:15:02,764 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,766 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 80 [2018-04-06 22:15:02,770 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 62 [2018-04-06 22:15:02,849 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:02,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2018-04-06 22:15:02,906 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:02,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-04-06 22:15:02,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-04-06 22:15:02,967 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-04-06 22:15:02,986 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:02,999 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-06 22:15:03,001 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,010 INFO L267 ElimStorePlain]: Start of recursive call 88: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-04-06 22:15:03,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2018-04-06 22:15:03,025 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-04-06 22:15:03,048 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-04-06 22:15:03,070 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,089 INFO L267 ElimStorePlain]: Start of recursive call 92: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 22:15:03,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-06 22:15:03,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,118 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 29 treesize of output 16 [2018-04-06 22:15:03,119 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,122 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,130 INFO L267 ElimStorePlain]: Start of recursive call 82: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,141 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,148 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 22:15:03,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-06 22:15:03,185 INFO L202 ElimStorePlain]: Needed 97 recursive calls to eliminate 11 variables, input treesize:481, output treesize:126 [2018-04-06 22:15:03,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-04-06 22:15:03,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 22:15:03,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 22:15:03,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 22:15:03,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-06 22:15:03,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:101, output treesize:60 [2018-04-06 22:15:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 22:15:03,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 22:15:03,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-04-06 22:15:03,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-06 22:15:03,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-06 22:15:03,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=992, Unknown=4, NotChecked=0, Total=1122 [2018-04-06 22:15:03,479 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 34 states. [2018-04-06 22:15:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 22:15:03,491 INFO L93 Difference]: Finished difference Result 299 states and 332 transitions. [2018-04-06 22:15:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-06 22:15:03,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-04-06 22:15:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 22:15:03,492 INFO L225 Difference]: With dead ends: 299 [2018-04-06 22:15:03,492 INFO L226 Difference]: Without dead ends: 0 [2018-04-06 22:15:03,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=126, Invalid=992, Unknown=4, NotChecked=0, Total=1122 [2018-04-06 22:15:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-06 22:15:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-06 22:15:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-06 22:15:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-06 22:15:03,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-04-06 22:15:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 22:15:03,493 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-06 22:15:03,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-06 22:15:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-06 22:15:03,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-06 22:15:03,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-04-06 22:15:03,538 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-04-06 22:15:03,538 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-04-06 22:15:03,538 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-04-06 22:15:03,538 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-04-06 22:15:03,538 INFO L412 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: false [2018-04-06 22:15:03,538 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-04-06 22:15:03,538 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-04-06 22:15:03,538 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point mainErr35RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point mainErr0RequiresViolation(line 986) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point L986'(line 986) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point mainErr9RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point mainErr51RequiresViolation(line 997) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point L994'''(lines 994 998) no Hoare annotation was computed. [2018-04-06 22:15:03,539 INFO L416 ceAbstractionStarter]: For program point L987''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point mainErr4RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point mainErr55RequiresViolation(line 1006) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point mainErr29RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point L996'''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point L987'''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point L987'(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point mainErr45RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point mainErr19RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,540 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L987''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point mainErr14RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L990'''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L990'''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,541 INFO L416 ceAbstractionStarter]: For program point L996'(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point mainErr21RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point mainErr39RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point L987'''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point mainErr56RequiresViolation(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point mainErr30RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L416 ceAbstractionStarter]: For program point mainErr41RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,542 INFO L419 ceAbstractionStarter]: At program point L1008''(lines 1002 1009) the Hoare annotation is: true [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point L996''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point mainErr25RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point mainErr10RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point mainErr61AssertViolationMEMORY_FREE(line 1008) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point mainErr36RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point L997'(line 997) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,543 INFO L416 ceAbstractionStarter]: For program point mainErr11RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point mainErr24RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 982 1012) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point L987'''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point mainErr16RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point mainErr40RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point mainErr32RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L416 ceAbstractionStarter]: For program point L1007'''(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,544 INFO L419 ceAbstractionStarter]: At program point L994''(lines 994 998) the Hoare annotation is: true [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr57RequiresViolation(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr5RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr46RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr54RequiresViolation(line 1006) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr8RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,545 INFO L416 ceAbstractionStarter]: For program point mainErr38RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1002(lines 1002 1009) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1004(line 1004) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1006'''''(lines 1006 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point mainErr62EnsuresViolationMEMORY_LEAK(lines 982 1012) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1006(line 1006) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1005(line 1005) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1008(line 1008) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L1007(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,546 INFO L416 ceAbstractionStarter]: For program point L990''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point mainErr49RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L1002''(lines 1002 1009) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point mainErr27RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L986(line 986) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L985(line 985) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point L1005'(line 1005) no Hoare annotation was computed. [2018-04-06 22:15:03,547 INFO L416 ceAbstractionStarter]: For program point mainErr58AssertViolationMEMORY_FREE(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point L987(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point mainErr2RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point L990''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L419 ceAbstractionStarter]: At program point L990'''''''''''''''''''''''''''''''(line 990) the Hoare annotation is: true [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point mainErr43RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L416 ceAbstractionStarter]: For program point mainErr17RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,548 INFO L419 ceAbstractionStarter]: At program point L996''''''''''''''''''''''''''''''''''''''(line 996) the Hoare annotation is: true [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L1005''(line 1005) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point mainErr37RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L990'(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 982 1012) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point mainErr7RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point mainErr53RequiresViolation(line 1005) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,549 INFO L416 ceAbstractionStarter]: For program point L990''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point mainErr22RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point mainErr59AssertViolationMEMORY_FREE(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L996''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point mainErr6RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L987''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point mainErr48RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,550 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point mainErr47RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L996''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L987'''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point mainErr13RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point mainErr3RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,551 INFO L416 ceAbstractionStarter]: For program point L990(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L996'''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L997(line 997) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L996(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L994(lines 994 998) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point mainErr33RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point mainErr28RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L990'''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,552 INFO L416 ceAbstractionStarter]: For program point L1006''''(line 1006) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr1RequiresViolation(line 986) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr52RequiresViolation(line 1005) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr18RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr44RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point L990''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr34RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr26RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point L1007''(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,553 INFO L416 ceAbstractionStarter]: For program point mainErr42RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L1008'(line 1008) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L419 ceAbstractionStarter]: At program point mainENTRY(lines 982 1012) the Hoare annotation is: true [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point mainErr50RequiresViolation(line 997) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L996''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point mainErr31RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L990''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L1007'(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,554 INFO L416 ceAbstractionStarter]: For program point L987''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point mainErr60AssertViolationMEMORY_FREE(line 1008) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L1006''(line 1006) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L1007''''(line 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L996''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point mainErr20RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point mainErr12RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L996'''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,555 INFO L416 ceAbstractionStarter]: For program point L1006'(lines 1006 1007) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point mainErr15RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''(line 996) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point mainErr23RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,556 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-06 22:15:03,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:15:03 BoogieIcfgContainer [2018-04-06 22:15:03,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 22:15:03,565 INFO L168 Benchmark]: Toolchain (without parser) took 36552.94 ms. Allocated memory was 303.0 MB in the beginning and 679.5 MB in the end (delta: 376.4 MB). Free memory was 239.5 MB in the beginning and 438.8 MB in the end (delta: -199.3 MB). Peak memory consumption was 177.2 MB. Max. memory is 5.3 GB. [2018-04-06 22:15:03,566 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 22:15:03,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.12 ms. Allocated memory is still 303.0 MB. Free memory was 239.5 MB in the beginning and 211.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. [2018-04-06 22:15:03,566 INFO L168 Benchmark]: Boogie Preprocessor took 67.24 ms. Allocated memory is still 303.0 MB. Free memory was 211.5 MB in the beginning and 208.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 22:15:03,567 INFO L168 Benchmark]: RCFGBuilder took 713.58 ms. Allocated memory was 303.0 MB in the beginning and 459.8 MB in the end (delta: 156.8 MB). Free memory was 208.5 MB in the beginning and 373.7 MB in the end (delta: -165.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-04-06 22:15:03,567 INFO L168 Benchmark]: TraceAbstraction took 35418.03 ms. Allocated memory was 459.8 MB in the beginning and 679.5 MB in the end (delta: 219.7 MB). Free memory was 373.7 MB in the beginning and 438.8 MB in the end (delta: -65.1 MB). Peak memory consumption was 154.6 MB. Max. memory is 5.3 GB. [2018-04-06 22:15:03,569 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.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 349.12 ms. Allocated memory is still 303.0 MB. Free memory was 239.5 MB in the beginning and 211.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.24 ms. Allocated memory is still 303.0 MB. Free memory was 211.5 MB in the beginning and 208.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 713.58 ms. Allocated memory was 303.0 MB in the beginning and 459.8 MB in the end (delta: 156.8 MB). Free memory was 208.5 MB in the beginning and 373.7 MB in the end (delta: -165.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 35418.03 ms. Allocated memory was 459.8 MB in the beginning and 679.5 MB in the end (delta: 219.7 MB). Free memory was 373.7 MB in the beginning and 438.8 MB in the end (delta: -65.1 MB). Peak memory consumption was 154.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 997]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1006]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 986]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1006]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 982]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1008]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 997]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1005]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 986]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1008]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1005]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 63 specifications checked. All of them hold - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 184 locations, 63 error locations. SAFE Result, 35.3s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3003 SDtfs, 10504 SDslu, 12183 SDs, 0 SdLazy, 7916 SolverSat, 781 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 1144 SyntacticMatches, 3 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5150 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=20, 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 3103 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1298 ConstructedInterpolants, 185 QuantifiedInterpolants, 936756 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2308 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 42 InterpolantComputations, 36 PerfectInterpolantSequences, 12/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_22-15-03-580.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_22-15-03-580.csv Received shutdown request...