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-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 23:18:21,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 23:18:21,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 23:18:21,492 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 23:18:21,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 23:18:21,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 23:18:21,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 23:18:21,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 23:18:21,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 23:18:21,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 23:18:21,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 23:18:21,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 23:18:21,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 23:18:21,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 23:18:21,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 23:18:21,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 23:18:21,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 23:18:21,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 23:18:21,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 23:18:21,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 23:18:21,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 23:18:21,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 23:18:21,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 23:18:21,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 23:18:21,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 23:18:21,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 23:18:21,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 23:18:21,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 23:18:21,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 23:18:21,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 23:18:21,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 23:18:21,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 23:18:21,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 23:18:21,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 23:18:21,545 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 23:18:21,545 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 23:18:21,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 23:18:21,546 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 23:18:21,546 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 23:18:21,546 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 23:18:21,547 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 23:18:21,547 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 23:18:21,547 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 23:18:21,547 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 23:18:21,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 23:18:21,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 23:18:21,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 23:18:21,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 23:18:21,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 23:18:21,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 23:18:21,549 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 23:18:21,549 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 23:18:21,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 23:18:21,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 23:18:21,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 23:18:21,550 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 23:18:21,550 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 23:18:21,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 23:18:21,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 23:18:21,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:21,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 23:18:21,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 23:18:21,552 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 23:18:21,553 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 23:18:21,553 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 23:18:21,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 23:18:21,600 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 23:18:21,604 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 23:18:21,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 23:18:21,606 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 23:18:21,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:21,943 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3eca711cc [2018-04-09 23:18:22,132 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 23:18:22,132 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 23:18:22,133 INFO L168 CDTParser]: Scanning sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,145 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 23:18:22,145 INFO L215 ultiparseSymbolTable]: [2018-04-09 23:18:22,145 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 23:18:22,145 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____intptr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__idtype_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__size_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,146 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__div_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,147 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____socklen_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__lldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,148 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__register_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,149 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsword_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uint in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ushort in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____useconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__wchar_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_once_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____qaddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__SLL in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ulong in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_set in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:22,175 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3eca711cc [2018-04-09 23:18:22,180 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 23:18:22,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 23:18:22,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 23:18:22,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 23:18:22,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 23:18:22,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd08ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22, skipping insertion in model container [2018-04-09 23:18:22,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,210 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 23:18:22,244 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 23:18:22,436 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 23:18:22,496 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 23:18:22,504 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 23:18:22,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22 WrapperNode [2018-04-09 23:18:22,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 23:18:22,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 23:18:22,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 23:18:22,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 23:18:22,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... [2018-04-09 23:18:22,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 23:18:22,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 23:18:22,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 23:18:22,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 23:18:22,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 23:18:22,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 23:18:22,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 23:18:22,736 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 23:18:22,736 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 23:18:22,736 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 23:18:22,737 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 23:18:22,738 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 23:18:22,739 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 23:18:22,740 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 23:18:22,741 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 23:18:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 23:18:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 23:18:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 23:18:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 23:18:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 23:18:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 23:18:23,451 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 23:18:23,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 11:18:23 BoogieIcfgContainer [2018-04-09 23:18:23,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 23:18:23,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 23:18:23,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 23:18:23,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 23:18:23,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 11:18:22" (1/3) ... [2018-04-09 23:18:23,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a80b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 11:18:23, skipping insertion in model container [2018-04-09 23:18:23,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 11:18:22" (2/3) ... [2018-04-09 23:18:23,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a80b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 11:18:23, skipping insertion in model container [2018-04-09 23:18:23,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 11:18:23" (3/3) ... [2018-04-09 23:18:23,459 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-04-09 23:18:23,469 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 23:18:23,477 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-09 23:18:23,528 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 23:18:23,529 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 23:18:23,529 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 23:18:23,529 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 23:18:23,529 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 23:18:23,529 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 23:18:23,530 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 23:18:23,530 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 23:18:23,530 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 23:18:23,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 23:18:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2018-04-09 23:18:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 23:18:23,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:23,562 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:23,562 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1682744903, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:23,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:23,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:23,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:23,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:23,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:23,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:23,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:23,735 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:23,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 23:18:23,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 23:18:23,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 23:18:23,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 23:18:23,755 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 4 states. [2018-04-09 23:18:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:24,056 INFO L93 Difference]: Finished difference Result 516 states and 645 transitions. [2018-04-09 23:18:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 23:18:24,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-09 23:18:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:24,072 INFO L225 Difference]: With dead ends: 516 [2018-04-09 23:18:24,072 INFO L226 Difference]: Without dead ends: 251 [2018-04-09 23:18:24,077 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-09 23:18:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-09 23:18:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2018-04-09 23:18:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-09 23:18:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2018-04-09 23:18:24,131 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 9 [2018-04-09 23:18:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:24,131 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2018-04-09 23:18:24,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 23:18:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2018-04-09 23:18:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 23:18:24,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:24,132 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:24,132 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1682744902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:24,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:24,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:24,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:24,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 23:18:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:24,227 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:24,276 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:24,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 23:18:24,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 23:18:24,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 23:18:24,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 23:18:24,278 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 6 states. [2018-04-09 23:18:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:24,472 INFO L93 Difference]: Finished difference Result 254 states and 267 transitions. [2018-04-09 23:18:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 23:18:24,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-09 23:18:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:24,476 INFO L225 Difference]: With dead ends: 254 [2018-04-09 23:18:24,476 INFO L226 Difference]: Without dead ends: 244 [2018-04-09 23:18:24,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-09 23:18:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-04-09 23:18:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-09 23:18:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2018-04-09 23:18:24,501 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 9 [2018-04-09 23:18:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:24,501 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2018-04-09 23:18:24,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 23:18:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2018-04-09 23:18:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 23:18:24,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:24,502 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:24,502 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash 259421962, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:24,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:24,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:24,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-09 23:18:24,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:24,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-09 23:18:24,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 23:18:24,602 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-09 23:18:24,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:24,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-09 23:18:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:24,623 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:24,649 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:24,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 23:18:24,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 23:18:24,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 23:18:24,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:18:24,650 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 5 states. [2018-04-09 23:18:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:25,087 INFO L93 Difference]: Finished difference Result 397 states and 426 transitions. [2018-04-09 23:18:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:18:25,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-09 23:18:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:25,090 INFO L225 Difference]: With dead ends: 397 [2018-04-09 23:18:25,090 INFO L226 Difference]: Without dead ends: 396 [2018-04-09 23:18:25,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-09 23:18:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 230. [2018-04-09 23:18:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-09 23:18:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 250 transitions. [2018-04-09 23:18:25,108 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 250 transitions. Word has length 19 [2018-04-09 23:18:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:25,108 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 250 transitions. [2018-04-09 23:18:25,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 23:18:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 250 transitions. [2018-04-09 23:18:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 23:18:25,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:25,109 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:25,109 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 259421963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:25,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:25,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:25,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 6 treesize of output 5 [2018-04-09 23:18:25,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 23:18:25,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:25,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:25,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:25,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:25,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,205 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-09 23:18:25,215 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-09 23:18:25,218 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-09 23:18:25,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:25,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:25,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-09 23:18:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:25,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:25,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-09 23:18:25,298 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:25,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 23:18:25,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 23:18:25,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 23:18:25,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:25,299 INFO L87 Difference]: Start difference. First operand 230 states and 250 transitions. Second operand 8 states. [2018-04-09 23:18:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:25,645 INFO L93 Difference]: Finished difference Result 432 states and 471 transitions. [2018-04-09 23:18:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:18:25,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-09 23:18:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:25,647 INFO L225 Difference]: With dead ends: 432 [2018-04-09 23:18:25,647 INFO L226 Difference]: Without dead ends: 431 [2018-04-09 23:18:25,647 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 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-09 23:18:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-09 23:18:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 229. [2018-04-09 23:18:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-09 23:18:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 249 transitions. [2018-04-09 23:18:25,660 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 249 transitions. Word has length 19 [2018-04-09 23:18:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:25,660 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 249 transitions. [2018-04-09 23:18:25,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 23:18:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 249 transitions. [2018-04-09 23:18:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 23:18:25,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:25,661 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] [2018-04-09 23:18:25,661 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1793522347, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:25,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:25,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:25,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:25,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:25,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 23:18:25,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 23:18:25,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:25,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:25,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-09 23:18:25,767 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-09 23:18:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:25,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:25,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-09 23:18:25,821 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 44 treesize of output 30 [2018-04-09 23:18:25,827 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 25 treesize of output 10 [2018-04-09 23:18:25,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 23:18:25,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:25,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:25,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-09 23:18:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:25,866 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:25,933 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-09 23:18:25,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:25,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:18:26,006 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-09 23:18:26,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 23:18:26,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 8 treesize of output 1 [2018-04-09 23:18:26,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,018 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:18:26,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 23:18:26,060 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-09 23:18:26,114 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:26,114 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-09 23:18:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:26,141 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:26,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-09 23:18:26,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 23:18:26,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 23:18:26,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-09 23:18:26,142 INFO L87 Difference]: Start difference. First operand 229 states and 249 transitions. Second operand 14 states. [2018-04-09 23:18:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:26,981 INFO L93 Difference]: Finished difference Result 400 states and 427 transitions. [2018-04-09 23:18:26,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 23:18:26,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-04-09 23:18:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:26,983 INFO L225 Difference]: With dead ends: 400 [2018-04-09 23:18:26,983 INFO L226 Difference]: Without dead ends: 399 [2018-04-09 23:18:26,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-04-09 23:18:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-09 23:18:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 228. [2018-04-09 23:18:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-09 23:18:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-09 23:18:26,993 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 22 [2018-04-09 23:18:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:26,993 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-09 23:18:26,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 23:18:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-09 23:18:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 23:18:26,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:26,994 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] [2018-04-09 23:18:26,994 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1793522348, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:27,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:27,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:27,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:27,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:27,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 23:18:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 23:18:27,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 23:18:27,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:27,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:27,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:27,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:27,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-09 23:18:27,121 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-09 23:18:27,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:27,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,145 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-09 23:18:27,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:27,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:27,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-09 23:18:27,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-09 23:18:27,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 23:18:27,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,208 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 36 treesize of output 17 [2018-04-09 23:18:27,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,232 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 26 treesize of output 24 [2018-04-09 23:18:27,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 23:18:27,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:27,242 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,249 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-09 23:18:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:27,261 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:27,366 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-09 23:18:27,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-09 23:18:27,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 23:18:27,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:27,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,410 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-09 23:18:27,412 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-09 23:18:27,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,415 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:18:27,457 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-09 23:18:27,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:27,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:18:27,487 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-09 23:18:27,488 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,492 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 23:18:27,576 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-09 23:18:27,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:27,594 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,601 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-09 23:18:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:27,603 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,604 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,608 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-09 23:18:27,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 23:18:27,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:27,626 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,631 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-09 23:18:27,633 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-09 23:18:27,633 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,635 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,638 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-09 23:18:27,641 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-09 23:18:27,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:27,659 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,665 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-09 23:18:27,667 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-09 23:18:27,667 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,668 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,671 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 23:18:27,691 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-09 23:18:27,729 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-09 23:18:27,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 23:18:27,743 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 23:18:27,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:27,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-09 23:18:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:27,779 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:27,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-09 23:18:27,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 23:18:27,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 23:18:27,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 23:18:27,780 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 14 states. [2018-04-09 23:18:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:28,702 INFO L93 Difference]: Finished difference Result 402 states and 429 transitions. [2018-04-09 23:18:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 23:18:28,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-04-09 23:18:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:28,704 INFO L225 Difference]: With dead ends: 402 [2018-04-09 23:18:28,704 INFO L226 Difference]: Without dead ends: 401 [2018-04-09 23:18:28,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-09 23:18:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-09 23:18:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 227. [2018-04-09 23:18:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-09 23:18:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2018-04-09 23:18:28,716 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 22 [2018-04-09 23:18:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:28,716 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2018-04-09 23:18:28,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 23:18:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2018-04-09 23:18:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 23:18:28,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:28,717 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:28,717 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash -706368499, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:28,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:28,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:28,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 10 treesize of output 9 [2018-04-09 23:18:28,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:28,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:28,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-09 23:18:28,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:28,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:28,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:28,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:28,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:28,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-09 23:18:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:28,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:28,876 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:28,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 23:18:28,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 23:18:28,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 23:18:28,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:18:28,877 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand 5 states. [2018-04-09 23:18:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:29,013 INFO L93 Difference]: Finished difference Result 539 states and 584 transitions. [2018-04-09 23:18:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:18:29,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-09 23:18:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:29,014 INFO L225 Difference]: With dead ends: 539 [2018-04-09 23:18:29,015 INFO L226 Difference]: Without dead ends: 343 [2018-04-09 23:18:29,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 23:18:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-09 23:18:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-04-09 23:18:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-09 23:18:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2018-04-09 23:18:29,025 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 32 [2018-04-09 23:18:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:29,025 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2018-04-09 23:18:29,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 23:18:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2018-04-09 23:18:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 23:18:29,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:29,026 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] [2018-04-09 23:18:29,026 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash -881231630, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:29,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:29,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:29,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:29,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:29,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 23:18:29,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,113 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-09 23:18:29,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:29,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 23:18:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:29,129 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:29,219 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,220 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2018-04-09 23:18:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:29,253 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:29,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 23:18:29,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 23:18:29,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 23:18:29,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:29,254 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 8 states. [2018-04-09 23:18:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:29,545 INFO L93 Difference]: Finished difference Result 313 states and 335 transitions. [2018-04-09 23:18:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 23:18:29,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-09 23:18:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:29,547 INFO L225 Difference]: With dead ends: 313 [2018-04-09 23:18:29,547 INFO L226 Difference]: Without dead ends: 299 [2018-04-09 23:18:29,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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-09 23:18:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-09 23:18:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2018-04-09 23:18:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-09 23:18:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 287 transitions. [2018-04-09 23:18:29,557 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 287 transitions. Word has length 34 [2018-04-09 23:18:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:29,557 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 287 transitions. [2018-04-09 23:18:29,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 23:18:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 287 transitions. [2018-04-09 23:18:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 23:18:29,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:29,559 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:29,559 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 258515189, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:29,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:29,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:29,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:29,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:29,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:29,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:29,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 23:18:29,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 23:18:29,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 23:18:29,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:29,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 23:18:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:29,628 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:29,660 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:29,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 23:18:29,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 23:18:29,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 23:18:29,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 23:18:29,661 INFO L87 Difference]: Start difference. First operand 255 states and 287 transitions. Second operand 6 states. [2018-04-09 23:18:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:29,933 INFO L93 Difference]: Finished difference Result 385 states and 438 transitions. [2018-04-09 23:18:29,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 23:18:29,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-09 23:18:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:29,937 INFO L225 Difference]: With dead ends: 385 [2018-04-09 23:18:29,938 INFO L226 Difference]: Without dead ends: 382 [2018-04-09 23:18:29,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 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-09 23:18:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-09 23:18:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 252. [2018-04-09 23:18:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 23:18:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-04-09 23:18:29,951 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 38 [2018-04-09 23:18:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:29,952 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-04-09 23:18:29,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 23:18:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-04-09 23:18:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 23:18:29,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:29,953 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:29,953 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash 258515190, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:29,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:29,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:29,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:30,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 23:18:30,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:30,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:30,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:30,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:30,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 23:18:30,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 23:18:30,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 23:18:30,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 23:18:30,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 23:18:30,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:30,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-09 23:18:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:30,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:30,178 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:30,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-09 23:18:30,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 23:18:30,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 23:18:30,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-09 23:18:30,179 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 10 states. [2018-04-09 23:18:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:30,635 INFO L93 Difference]: Finished difference Result 420 states and 478 transitions. [2018-04-09 23:18:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 23:18:30,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-09 23:18:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:30,637 INFO L225 Difference]: With dead ends: 420 [2018-04-09 23:18:30,637 INFO L226 Difference]: Without dead ends: 413 [2018-04-09 23:18:30,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 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-09 23:18:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-09 23:18:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 245. [2018-04-09 23:18:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 23:18:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2018-04-09 23:18:30,649 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 38 [2018-04-09 23:18:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:30,650 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2018-04-09 23:18:30,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 23:18:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2018-04-09 23:18:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 23:18:30,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:30,651 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:30,651 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1836950969, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:30,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:30,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:30,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:30,758 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:30,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2018-04-09 23:18:30,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 23:18:30,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 23:18:30,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-09 23:18:30,759 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand 9 states. [2018-04-09 23:18:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:30,977 INFO L93 Difference]: Finished difference Result 283 states and 300 transitions. [2018-04-09 23:18:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 23:18:30,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-09 23:18:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:30,979 INFO L225 Difference]: With dead ends: 283 [2018-04-09 23:18:30,979 INFO L226 Difference]: Without dead ends: 282 [2018-04-09 23:18:30,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-04-09 23:18:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-09 23:18:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 245. [2018-04-09 23:18:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 23:18:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2018-04-09 23:18:30,987 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 41 [2018-04-09 23:18:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:30,987 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2018-04-09 23:18:30,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 23:18:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2018-04-09 23:18:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 23:18:30,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:30,988 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:30,988 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -76001208, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:31,002 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:31,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,109 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,158 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:31,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-09 23:18:31,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 23:18:31,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 23:18:31,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:18:31,159 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand 5 states. [2018-04-09 23:18:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:31,195 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-04-09 23:18:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 23:18:31,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-09 23:18:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:31,197 INFO L225 Difference]: With dead ends: 256 [2018-04-09 23:18:31,197 INFO L226 Difference]: Without dead ends: 253 [2018-04-09 23:18:31,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:18:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-09 23:18:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2018-04-09 23:18:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 23:18:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2018-04-09 23:18:31,207 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 43 [2018-04-09 23:18:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:31,207 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2018-04-09 23:18:31,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 23:18:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2018-04-09 23:18:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 23:18:31,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:31,208 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:31,209 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2061295180, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:31,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:31,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,335 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:31,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 23:18:31,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 23:18:31,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 23:18:31,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 23:18:31,336 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand 3 states. [2018-04-09 23:18:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:31,467 INFO L93 Difference]: Finished difference Result 326 states and 364 transitions. [2018-04-09 23:18:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 23:18:31,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-04-09 23:18:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:31,469 INFO L225 Difference]: With dead ends: 326 [2018-04-09 23:18:31,469 INFO L226 Difference]: Without dead ends: 255 [2018-04-09 23:18:31,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 23:18:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-09 23:18:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2018-04-09 23:18:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-09 23:18:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 273 transitions. [2018-04-09 23:18:31,477 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 273 transitions. Word has length 50 [2018-04-09 23:18:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:31,477 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 273 transitions. [2018-04-09 23:18:31,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 23:18:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 273 transitions. [2018-04-09 23:18:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 23:18:31,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:31,478 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:31,478 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash 822248062, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:31,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:31,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:31,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:31,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:31,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:31,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:31,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-09 23:18:31,652 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-09 23:18:31,654 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-09 23:18:31,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-09 23:18:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,662 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,695 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:31,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 23:18:31,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 23:18:31,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 23:18:31,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:18:31,696 INFO L87 Difference]: Start difference. First operand 245 states and 273 transitions. Second operand 5 states. [2018-04-09 23:18:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:31,878 INFO L93 Difference]: Finished difference Result 399 states and 446 transitions. [2018-04-09 23:18:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:18:31,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-09 23:18:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:31,880 INFO L225 Difference]: With dead ends: 399 [2018-04-09 23:18:31,880 INFO L226 Difference]: Without dead ends: 398 [2018-04-09 23:18:31,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-09 23:18:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2018-04-09 23:18:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-09 23:18:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2018-04-09 23:18:31,892 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 51 [2018-04-09 23:18:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:31,892 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2018-04-09 23:18:31,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 23:18:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2018-04-09 23:18:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 23:18:31,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:31,893 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:31,893 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash 822248063, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:31,902 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:31,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:31,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:31,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 23:18:31,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:31,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:31,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:31,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:31,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-09 23:18:31,961 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-09 23:18:31,962 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-09 23:18:31,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:31,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:31,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:31,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-09 23:18:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:31,978 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:32,031 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:32,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 23:18:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 23:18:32,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 23:18:32,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 23:18:32,031 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand 8 states. [2018-04-09 23:18:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:32,356 INFO L93 Difference]: Finished difference Result 437 states and 491 transitions. [2018-04-09 23:18:32,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:18:32,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-04-09 23:18:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:32,358 INFO L225 Difference]: With dead ends: 437 [2018-04-09 23:18:32,358 INFO L226 Difference]: Without dead ends: 436 [2018-04-09 23:18:32,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 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-09 23:18:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-09 23:18:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 243. [2018-04-09 23:18:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-09 23:18:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2018-04-09 23:18:32,368 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 51 [2018-04-09 23:18:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:32,368 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2018-04-09 23:18:32,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 23:18:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2018-04-09 23:18:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 23:18:32,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:32,369 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:32,369 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 542361206, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:32,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:32,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:32,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:32,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:32,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:32,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:32,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-04-09 23:18:32,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:32,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:32,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:18:32,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:18:32,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:32,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:7 [2018-04-09 23:18:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:32,524 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:32,576 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:32,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 11 [2018-04-09 23:18:32,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 23:18:32,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 23:18:32,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-09 23:18:32,577 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand 11 states. [2018-04-09 23:18:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:33,103 INFO L93 Difference]: Finished difference Result 573 states and 631 transitions. [2018-04-09 23:18:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 23:18:33,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-09 23:18:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:33,106 INFO L225 Difference]: With dead ends: 573 [2018-04-09 23:18:33,106 INFO L226 Difference]: Without dead ends: 425 [2018-04-09 23:18:33,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2018-04-09 23:18:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-09 23:18:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 299. [2018-04-09 23:18:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-09 23:18:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 331 transitions. [2018-04-09 23:18:33,125 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 331 transitions. Word has length 52 [2018-04-09 23:18:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:33,125 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 331 transitions. [2018-04-09 23:18:33,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 23:18:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 331 transitions. [2018-04-09 23:18:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 23:18:33,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:33,126 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:33,126 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1393673946, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:33,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:33,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:33,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:33,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:33,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:33,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:33,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 23:18:33,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 23:18:33,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 23:18:33,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 23:18:33,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:33,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:33,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 23:18:33,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 23:18:33,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:33,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:33,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-09 23:18:33,262 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-09 23:18:33,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:33,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:33,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-09 23:18:33,304 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 44 treesize of output 30 [2018-04-09 23:18:33,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-09 23:18:33,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-09 23:18:33,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:33,322 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-09 23:18:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:33,335 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:33,385 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-09 23:18:33,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:33,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:18:33,412 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-09 23:18:33,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 23:18:33,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:33,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,419 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:33,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:18:33,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 23:18:33,441 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-09 23:18:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:33,534 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:33,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 23:18:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 23:18:33,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 23:18:33,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-04-09 23:18:33,535 INFO L87 Difference]: Start difference. First operand 299 states and 331 transitions. Second operand 20 states. [2018-04-09 23:18:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:34,343 INFO L93 Difference]: Finished difference Result 462 states and 513 transitions. [2018-04-09 23:18:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 23:18:34,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-09 23:18:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:34,345 INFO L225 Difference]: With dead ends: 462 [2018-04-09 23:18:34,345 INFO L226 Difference]: Without dead ends: 461 [2018-04-09 23:18:34,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 23:18:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-09 23:18:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 298. [2018-04-09 23:18:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-09 23:18:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 330 transitions. [2018-04-09 23:18:34,357 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 330 transitions. Word has length 54 [2018-04-09 23:18:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:34,358 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 330 transitions. [2018-04-09 23:18:34,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 23:18:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 330 transitions. [2018-04-09 23:18:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 23:18:34,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:34,358 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:34,358 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1393673947, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:34,365 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:34,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:34,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 23:18:34,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 23:18:34,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:34,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:34,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 23:18:34,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 23:18:34,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 23:18:34,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 23:18:34,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 6 treesize of output 5 [2018-04-09 23:18:34,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:34,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:34,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 23:18:34,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 23:18:34,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:34,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:34,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:34,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:34,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-09 23:18:34,490 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 68 treesize of output 62 [2018-04-09 23:18:34,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:34,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,509 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-09 23:18:34,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:34,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:34,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-09 23:18:34,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-09 23:18:34,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 23:18:34,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-09 23:18:34,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,571 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 26 treesize of output 24 [2018-04-09 23:18:34,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 15 treesize of output 3 [2018-04-09 23:18:34,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 23:18:34,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,583 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-09 23:18:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:34,596 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:34,727 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-09 23:18:34,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:34,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 23:18:34,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:34,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,774 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-09 23:18:34,781 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-09 23:18:34,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:18:34,852 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-09 23:18:34,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:34,882 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,888 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-09 23:18:34,890 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-09 23:18:34,891 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,904 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-09 23:18:34,908 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-09 23:18:34,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:34,929 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,936 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-09 23:18:34,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:34,941 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,948 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:34,954 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-09 23:18:34,957 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-09 23:18:35,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:35,002 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,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 24 treesize of output 20 [2018-04-09 23:18:35,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 20 treesize of output 7 [2018-04-09 23:18:35,014 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,016 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,021 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-09 23:18:35,056 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-09 23:18:35,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:35,072 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:18:35,080 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-09 23:18:35,080 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,081 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,085 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-09 23:18:35,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 23:18:35,102 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-09 23:18:35,134 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-09 23:18:35,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:35,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 23:18:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:35,209 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:35,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 23:18:35,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 23:18:35,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 23:18:35,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-09 23:18:35,210 INFO L87 Difference]: Start difference. First operand 298 states and 330 transitions. Second operand 20 states. [2018-04-09 23:18:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:35,946 INFO L93 Difference]: Finished difference Result 461 states and 512 transitions. [2018-04-09 23:18:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 23:18:35,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-09 23:18:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:35,948 INFO L225 Difference]: With dead ends: 461 [2018-04-09 23:18:35,948 INFO L226 Difference]: Without dead ends: 460 [2018-04-09 23:18:35,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 23:18:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-04-09 23:18:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 297. [2018-04-09 23:18:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-09 23:18:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 329 transitions. [2018-04-09 23:18:35,960 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 329 transitions. Word has length 54 [2018-04-09 23:18:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:35,960 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 329 transitions. [2018-04-09 23:18:35,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 23:18:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 329 transitions. [2018-04-09 23:18:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 23:18:35,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:35,961 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, 1, 1, 1] [2018-04-09 23:18:35,961 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -788014465, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:35,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:35,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:36,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:36,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:36,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 23:18:36,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 23:18:36,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-09 23:18:36,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 23:18:36,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 23:18:36,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 23:18:36,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 23:18:36,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-09 23:18:36,090 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 18 [2018-04-09 23:18:36,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,092 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 18 treesize of output 10 [2018-04-09 23:18:36,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,102 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 18 [2018-04-09 23:18:36,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,104 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 18 treesize of output 10 [2018-04-09 23:18:36,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-09 23:18:36,133 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-09 23:18:36,133 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:36,167 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-09 23:18:36,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 23:18:36,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-04-09 23:18:36,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 23:18:36,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 23:18:36,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-09 23:18:36,189 INFO L87 Difference]: Start difference. First operand 297 states and 329 transitions. Second operand 11 states. [2018-04-09 23:18:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:18:36,577 INFO L93 Difference]: Finished difference Result 577 states and 624 transitions. [2018-04-09 23:18:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 23:18:36,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-04-09 23:18:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:18:36,581 INFO L225 Difference]: With dead ends: 577 [2018-04-09 23:18:36,581 INFO L226 Difference]: Without dead ends: 458 [2018-04-09 23:18:36,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-04-09 23:18:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-09 23:18:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359. [2018-04-09 23:18:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-09 23:18:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 403 transitions. [2018-04-09 23:18:36,609 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 403 transitions. Word has length 55 [2018-04-09 23:18:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:18:36,610 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 403 transitions. [2018-04-09 23:18:36,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 23:18:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 403 transitions. [2018-04-09 23:18:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 23:18:36,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:18:36,611 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:18:36,611 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:18:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1378730339, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:18:36,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:18:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:18:36,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:18:36,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:18:36,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 23:18:36,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-09 23:18:36,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:18:36,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:18:36,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-09 23:18:36,740 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-09 23:18:36,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:18:36,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:36,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-09 23:18:36,797 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 60 treesize of output 46 [2018-04-09 23:18:36,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-09 23:18:36,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:36,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:36,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:61 [2018-04-09 23:18:42,849 WARN L151 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-04-09 23:18:42,881 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 46 treesize of output 32 [2018-04-09 23:18:42,883 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 7 treesize of output 1 [2018-04-09 23:18:42,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:42,887 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 25 treesize of output 10 [2018-04-09 23:18:42,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:42,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:42,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:18:42,895 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:15 [2018-04-09 23:18:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:42,948 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:18:43,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 23:18:43,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:18:43,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:43,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:18:43,153 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-09 23:18:43,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:43,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:43,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 23:18:43,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:18:43,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:18:43,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:18:43,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:18:43,193 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-09 23:18:43,194 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-04-09 23:18:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:18:43,257 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:18:43,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2018-04-09 23:18:43,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 23:18:43,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 23:18:43,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=415, Unknown=2, NotChecked=0, Total=506 [2018-04-09 23:18:43,258 INFO L87 Difference]: Start difference. First operand 359 states and 403 transitions. Second operand 23 states. [2018-04-09 23:18:58,030 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 38 DAG size of output 34 [2018-04-09 23:19:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:19:05,161 INFO L93 Difference]: Finished difference Result 634 states and 691 transitions. [2018-04-09 23:19:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 23:19:05,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-09 23:19:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:19:05,163 INFO L225 Difference]: With dead ends: 634 [2018-04-09 23:19:05,163 INFO L226 Difference]: Without dead ends: 631 [2018-04-09 23:19:05,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=529, Invalid=1532, Unknown=9, NotChecked=0, Total=2070 [2018-04-09 23:19:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-04-09 23:19:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 367. [2018-04-09 23:19:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-09 23:19:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 410 transitions. [2018-04-09 23:19:05,191 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 410 transitions. Word has length 57 [2018-04-09 23:19:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:19:05,191 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 410 transitions. [2018-04-09 23:19:05,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 23:19:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 410 transitions. [2018-04-09 23:19:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 23:19:05,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:19:05,192 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:19:05,192 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:19:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1378730340, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:19:05,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:19:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:19:05,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:19:05,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:19:05,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:19:05,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 23:19:05,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-09 23:19:05,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:05,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:05,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:05,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:05,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2018-04-09 23:19:05,288 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 57 treesize of output 51 [2018-04-09 23:19:05,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:19:05,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,305 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-09 23:19:05,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 23:19:05,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 23:19:05,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 [2018-04-09 23:19:05,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-04-09 23:19:05,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-09 23:19:05,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,408 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 90 treesize of output 76 [2018-04-09 23:19:05,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-09 23:19:05,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,435 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-09 23:19:05,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:124, output treesize:104 [2018-04-09 23:19:05,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-04-09 23:19:05,530 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 40 treesize of output 21 [2018-04-09 23:19:05,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,537 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 7 treesize of output 1 [2018-04-09 23:19:05,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,552 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 37 treesize of output 33 [2018-04-09 23:19:05,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-09 23:19:05,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,560 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 7 treesize of output 1 [2018-04-09 23:19:05,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,570 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:96, output treesize:11 [2018-04-09 23:19:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:05,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:19:05,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2018-04-09 23:19:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 23:19:05,678 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 30 treesize of output 28 [2018-04-09 23:19:05,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:05,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 23:19:05,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-04-09 23:19:07,973 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 43 treesize of output 34 [2018-04-09 23:19:07,991 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 11 treesize of output 10 [2018-04-09 23:19:07,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:07,998 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-09 23:19:07,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:19:07,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,033 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 45 treesize of output 36 [2018-04-09 23:19:08,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:19:08,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 23:19:08,064 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-09 23:19:08,064 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 23:19:08,097 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 45 treesize of output 36 [2018-04-09 23:19:08,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 23:19:08,115 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,122 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-09 23:19:08,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:19:08,123 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,125 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,129 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:08,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 23:19:08,148 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:134, output treesize:39 [2018-04-09 23:19:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:08,248 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:19:08,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2018-04-09 23:19:08,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 23:19:08,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 23:19:08,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=431, Unknown=1, NotChecked=0, Total=506 [2018-04-09 23:19:08,249 INFO L87 Difference]: Start difference. First operand 367 states and 410 transitions. Second operand 23 states. [2018-04-09 23:19:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:19:10,137 INFO L93 Difference]: Finished difference Result 728 states and 782 transitions. [2018-04-09 23:19:10,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 23:19:10,137 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-09 23:19:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:19:10,139 INFO L225 Difference]: With dead ends: 728 [2018-04-09 23:19:10,139 INFO L226 Difference]: Without dead ends: 725 [2018-04-09 23:19:10,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=644, Invalid=2111, Unknown=1, NotChecked=0, Total=2756 [2018-04-09 23:19:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-09 23:19:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 371. [2018-04-09 23:19:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-09 23:19:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 411 transitions. [2018-04-09 23:19:10,166 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 411 transitions. Word has length 57 [2018-04-09 23:19:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:19:10,167 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 411 transitions. [2018-04-09 23:19:10,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 23:19:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 411 transitions. [2018-04-09 23:19:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-09 23:19:10,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:19:10,168 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:19:10,168 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:19:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash -383266405, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:19:10,178 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:19:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:19:10,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:19:10,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:10,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:10,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:10,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:10,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-09 23:19:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:19:10,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:19:10,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 23:19:10,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 23:19:10,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-09 23:19:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 23:19:10,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:19:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 23:19:10,359 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:19:10,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 23:19:10,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 23:19:10,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 23:19:10,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 23:19:10,360 INFO L87 Difference]: Start difference. First operand 371 states and 411 transitions. Second operand 5 states. [2018-04-09 23:19:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:19:10,470 INFO L93 Difference]: Finished difference Result 456 states and 504 transitions. [2018-04-09 23:19:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 23:19:10,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-04-09 23:19:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:19:10,472 INFO L225 Difference]: With dead ends: 456 [2018-04-09 23:19:10,472 INFO L226 Difference]: Without dead ends: 392 [2018-04-09 23:19:10,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 23:19:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-09 23:19:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2018-04-09 23:19:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-09 23:19:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 425 transitions. [2018-04-09 23:19:10,489 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 425 transitions. Word has length 64 [2018-04-09 23:19:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:19:10,489 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 425 transitions. [2018-04-09 23:19:10,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 23:19:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 425 transitions. [2018-04-09 23:19:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-09 23:19:10,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:19:10,490 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:19:10,490 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:19:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -517484280, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:19:10,496 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:19:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:19:10,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:19:10,638 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 38 treesize of output 34 [2018-04-09 23:19:10,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-04-09 23:19:10,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 23:19:10,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 23:19:10,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-09 23:19:10,688 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 7 treesize of output 1 [2018-04-09 23:19:10,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,694 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 27 treesize of output 25 [2018-04-09 23:19:10,695 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 7 treesize of output 1 [2018-04-09 23:19:10,696 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,700 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,723 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 38 treesize of output 34 [2018-04-09 23:19:10,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-04-09 23:19:10,731 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-09 23:19:10,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 23:19:10,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-09 23:19:10,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 7 treesize of output 1 [2018-04-09 23:19:10,780 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,785 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,786 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 27 treesize of output 25 [2018-04-09 23:19:10,788 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 7 treesize of output 1 [2018-04-09 23:19:10,788 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,793 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:10,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 23:19:10,819 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:77, output treesize:26 [2018-04-09 23:19:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:10,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:19:11,131 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 38 treesize of output 34 [2018-04-09 23:19:11,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-09 23:19:11,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,200 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 38 treesize of output 34 [2018-04-09 23:19:11,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-09 23:19:11,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-09 23:19:11,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:19:11,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-09 23:19:11,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 23:19:11,241 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,245 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:11,255 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:7 [2018-04-09 23:19:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:11,294 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 23:19:11,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2018-04-09 23:19:11,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 23:19:11,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 23:19:11,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-04-09 23:19:11,295 INFO L87 Difference]: Start difference. First operand 385 states and 425 transitions. Second operand 18 states. [2018-04-09 23:19:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:19:12,301 INFO L93 Difference]: Finished difference Result 589 states and 639 transitions. [2018-04-09 23:19:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 23:19:12,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-09 23:19:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:19:12,303 INFO L225 Difference]: With dead ends: 589 [2018-04-09 23:19:12,303 INFO L226 Difference]: Without dead ends: 510 [2018-04-09 23:19:12,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2018-04-09 23:19:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-04-09 23:19:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 408. [2018-04-09 23:19:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-09 23:19:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 449 transitions. [2018-04-09 23:19:12,337 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 449 transitions. Word has length 69 [2018-04-09 23:19:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:19:12,338 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 449 transitions. [2018-04-09 23:19:12,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 23:19:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 449 transitions. [2018-04-09 23:19:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-09 23:19:12,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:19:12,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:19:12,339 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:19:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 238683477, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:19:12,349 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:19:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 23:19:12,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 23:19:12,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:12,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:12,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 23:19:12,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 23:19:12,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-09 23:19:12,525 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 18 [2018-04-09 23:19:12,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:19:12,530 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 18 treesize of output 10 [2018-04-09 23:19:12,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,543 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 18 [2018-04-09 23:19:12,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 23:19:12,546 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 18 treesize of output 10 [2018-04-09 23:19:12,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 23:19:12,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-09 23:19:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:12,591 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 23:19:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 23:19:12,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 23:19:12,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-04-09 23:19:12,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 23:19:12,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 23:19:12,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 23:19:12,695 INFO L87 Difference]: Start difference. First operand 408 states and 449 transitions. Second operand 14 states. [2018-04-09 23:19:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 23:19:13,348 INFO L93 Difference]: Finished difference Result 703 states and 750 transitions. [2018-04-09 23:19:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 23:19:13,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-04-09 23:19:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 23:19:13,350 INFO L225 Difference]: With dead ends: 703 [2018-04-09 23:19:13,350 INFO L226 Difference]: Without dead ends: 660 [2018-04-09 23:19:13,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2018-04-09 23:19:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-04-09 23:19:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 445. [2018-04-09 23:19:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-09 23:19:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 493 transitions. [2018-04-09 23:19:13,374 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 493 transitions. Word has length 69 [2018-04-09 23:19:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 23:19:13,374 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 493 transitions. [2018-04-09 23:19:13,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 23:19:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 493 transitions. [2018-04-09 23:19:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-09 23:19:13,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 23:19:13,375 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 23:19:13,375 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 23:19:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -633703354, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 23:19:13,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 23:19:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 23:19:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 23:19:13,491 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-09 23:19:13,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 11:19:13 BoogieIcfgContainer [2018-04-09 23:19:13,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 23:19:13,543 INFO L168 Benchmark]: Toolchain (without parser) took 51362.53 ms. Allocated memory was 306.2 MB in the beginning and 692.6 MB in the end (delta: 386.4 MB). Free memory was 243.5 MB in the beginning and 364.5 MB in the end (delta: -120.9 MB). Peak memory consumption was 265.5 MB. Max. memory is 5.3 GB. [2018-04-09 23:19:13,544 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 23:19:13,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.94 ms. Allocated memory is still 306.2 MB. Free memory was 243.5 MB in the beginning and 213.4 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB. [2018-04-09 23:19:13,545 INFO L168 Benchmark]: Boogie Preprocessor took 67.65 ms. Allocated memory is still 306.2 MB. Free memory was 213.4 MB in the beginning and 210.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 23:19:13,545 INFO L168 Benchmark]: RCFGBuilder took 837.19 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 210.5 MB in the beginning and 375.4 MB in the end (delta: -164.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-04-09 23:19:13,546 INFO L168 Benchmark]: TraceAbstraction took 50089.39 ms. Allocated memory was 469.2 MB in the beginning and 692.6 MB in the end (delta: 223.3 MB). Free memory was 375.4 MB in the beginning and 364.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 234.3 MB. Max. memory is 5.3 GB. [2018-04-09 23:19:13,548 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 362.94 ms. Allocated memory is still 306.2 MB. Free memory was 243.5 MB in the beginning and 213.4 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.65 ms. Allocated memory is still 306.2 MB. Free memory was 213.4 MB in the beginning and 210.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 837.19 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 210.5 MB in the beginning and 375.4 MB in the end (delta: -164.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50089.39 ms. Allocated memory was 469.2 MB in the beginning and 692.6 MB in the end (delta: 223.3 MB). Free memory was 375.4 MB in the beginning and 364.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 234.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={25:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={25:0}, malloc(sizeof(SLL))={25:0}] [L992] FCALL list->next = ((void*)0) VAL [list={25:0}, malloc(sizeof(SLL))={25:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={25:0}, malloc(sizeof(SLL))={25:0}] [L993] COND FALSE !(0) VAL [list={25:0}, malloc(sizeof(SLL))={25:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, list={25:0}, malloc(sizeof(SLL))={25:0}] [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] EXPR, FCALL list->inner VAL [list={25:0}, list->inner={17:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={25:0}, list->inner={17:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] EXPR, FCALL list->inner VAL [list={25:0}, list->inner={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={25:0}, list->inner={17:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] EXPR, FCALL list->inner VAL [list={25:0}, list->inner={17:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={25:0}, list->inner={17:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L993] COND TRUE, EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={25:0}, list->inner={17:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) VAL [list={25:0}, list->inner={17:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L993] COND FALSE !(0) VAL [list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L995] SLL* end = list; VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={25:0}, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1008] end = ((void*)0) VAL [end={0:0}, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1009] end = list VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1012] COND FALSE !(0) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1014] COND TRUE ((void*)0) != end VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1016] int len = 0; VAL [end={25:0}, len=0, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1017] EXPR, FCALL end->inner VAL [end={25:0}, end->inner={17:0}, len=0, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1017] SLL* inner = end->inner; VAL [end={25:0}, end->inner={17:0}, inner={17:0}, len=0, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1018] COND TRUE ((void*)0) != inner VAL [end={25:0}, inner={17:0}, len=0, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1020] COND TRUE len == 0 VAL [end={25:0}, inner={17:0}, len=0, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1021] len = 1 VAL [end={25:0}, inner={17:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={25:0}, inner={17:0}, len=1, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1024] COND FALSE !(0) VAL [end={25:0}, inner={17:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1025] EXPR, FCALL inner->inner VAL [end={25:0}, inner={17:0}, inner->inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) VAL [end={25:0}, inner={17:0}, inner->inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1025] COND FALSE !(0) VAL [end={25:0}, inner={17:0}, len=1, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1026] EXPR, FCALL inner->next VAL [end={25:0}, inner={17:0}, inner->next={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) VAL [end={25:0}, inner={17:0}, inner->next={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1026] COND FALSE !(0) VAL [end={25:0}, inner={17:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1027] EXPR, FCALL inner->inner VAL [end={25:0}, inner={17:0}, inner->inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1027] inner = inner->inner VAL [end={25:0}, inner={0:0}, inner->inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={25:0}] [L1028] COND TRUE len == 1 VAL [end={25:0}, inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 243 locations, 65 error locations. UNSAFE Result, 50.0s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5186 SDtfs, 14868 SDslu, 21955 SDs, 0 SdLazy, 11377 SolverSat, 668 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2204 GetRequests, 1794 SyntacticMatches, 9 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445occurred in iteration=24, 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, 24 MinimizatonAttempts, 3113 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 1079 NumberOfCodeBlocks, 1079 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1970 ConstructedInterpolants, 138 QuantifiedInterpolants, 1133165 SizeOfPredicates, 248 NumberOfNonLiveVariables, 3032 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 48 InterpolantComputations, 44 PerfectInterpolantSequences, 14/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_23-19-13-556.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_23-19-13-556.csv Received shutdown request...