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-8168ed2-m [2018-04-12 00:23:29,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 00:23:29,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 00:23:29,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 00:23:29,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 00:23:29,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 00:23:29,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 00:23:29,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 00:23:29,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 00:23:29,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 00:23:29,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 00:23:29,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 00:23:29,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 00:23:29,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 00:23:29,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 00:23:29,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 00:23:29,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 00:23:29,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 00:23:29,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 00:23:29,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 00:23:29,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 00:23:29,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 00:23:29,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 00:23:29,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 00:23:29,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 00:23:29,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 00:23:29,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 00:23:29,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 00:23:29,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 00:23:29,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 00:23:29,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 00:23:29,598 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-12 00:23:29,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 00:23:29,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 00:23:29,623 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-12 00:23:29,623 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-12 00:23:29,624 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-12 00:23:29,624 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-12 00:23:29,624 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-12 00:23:29,624 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-12 00:23:29,625 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-12 00:23:29,625 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-12 00:23:29,625 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-12 00:23:29,625 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-12 00:23:29,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 00:23:29,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 00:23:29,626 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 00:23:29,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 00:23:29,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 00:23:29,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 00:23:29,627 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 00:23:29,627 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-12 00:23:29,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 00:23:29,627 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 00:23:29,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 00:23:29,628 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-12 00:23:29,628 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-12 00:23:29,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 00:23:29,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 00:23:29,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 00:23:29,629 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 00:23:29,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 00:23:29,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-12 00:23:29,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-12 00:23:29,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-12 00:23:29,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-12 00:23:29,631 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-12 00:23:29,631 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-12 00:23:29,631 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-12 00:23:29,631 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-12 00:23:29,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 00:23:29,680 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 00:23:29,684 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 00:23:29,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 00:23:29,686 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 00:23:29,687 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-12 00:23:30,002 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG61ae84f0c [2018-04-12 00:23:30,176 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 00:23:30,176 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 00:23:30,176 INFO L168 CDTParser]: Scanning sll-01_false-unreach-call_false-valid-deref.i [2018-04-12 00:23:30,187 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 00:23:30,187 INFO L215 ultiparseSymbolTable]: [2018-04-12 00:23:30,187 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 00:23:30,187 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_false-unreach-call_false-valid-deref.i [2018-04-12 00:23:30,187 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 00:23:30,187 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,188 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,189 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,190 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,191 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,192 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,193 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,194 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,195 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,196 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,197 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,198 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,199 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,200 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,201 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-12 00:23:30,224 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG61ae84f0c [2018-04-12 00:23:30,228 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 00:23:30,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 00:23:30,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 00:23:30,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 00:23:30,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 00:23:30,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b434cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30, skipping insertion in model container [2018-04-12 00:23:30,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,253 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:23:30,288 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:23:30,468 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:23:30,525 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:23:30,533 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-12 00:23:30,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30 WrapperNode [2018-04-12 00:23:30,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 00:23:30,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 00:23:30,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 00:23:30,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 00:23:30,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (1/1) ... [2018-04-12 00:23:30,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 00:23:30,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 00:23:30,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 00:23:30,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 00:23:30,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (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-12 00:23:30,779 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 00:23:30,779 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 00:23:30,779 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 00:23:30,779 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 00:23:30,779 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 00:23:30,779 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 00:23:30,780 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 00:23:30,781 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 00:23:30,782 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 00:23:30,783 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 00:23:30,784 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 00:23:30,785 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 00:23:30,786 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 00:23:30,787 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 00:23:30,788 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 00:23:30,789 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 00:23:30,790 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 00:23:30,791 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 00:23:30,792 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 00:23:30,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 00:23:30,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 00:23:30,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 00:23:31,499 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 00:23:31,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:23:31 BoogieIcfgContainer [2018-04-12 00:23:31,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 00:23:31,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 00:23:31,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 00:23:31,504 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 00:23:31,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 12:23:30" (1/3) ... [2018-04-12 00:23:31,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f954311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:23:31, skipping insertion in model container [2018-04-12 00:23:31,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:23:30" (2/3) ... [2018-04-12 00:23:31,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f954311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:23:31, skipping insertion in model container [2018-04-12 00:23:31,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:23:31" (3/3) ... [2018-04-12 00:23:31,508 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-04-12 00:23:31,517 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 00:23:31,525 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-12 00:23:31,578 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 00:23:31,579 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 00:23:31,579 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-12 00:23:31,579 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 00:23:31,580 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 00:23:31,580 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 00:23:31,580 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 00:23:31,580 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 00:23:31,580 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 00:23:31,581 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 00:23:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2018-04-12 00:23:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:23:31,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:31,611 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:23:31,611 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-12 00:23:31,617 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-12 00:23:31,631 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:31,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:31,726 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-12 00:23:31,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:31,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:31,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:31,775 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-12 00:23:31,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:31,782 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-12 00:23:31,803 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:31,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:23:31,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:23:31,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:23:31,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:23:31,817 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 4 states. [2018-04-12 00:23:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:32,241 INFO L93 Difference]: Finished difference Result 516 states and 645 transitions. [2018-04-12 00:23:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:23:32,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-12 00:23:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:32,256 INFO L225 Difference]: With dead ends: 516 [2018-04-12 00:23:32,256 INFO L226 Difference]: Without dead ends: 251 [2018-04-12 00:23:32,261 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-12 00:23:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-12 00:23:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2018-04-12 00:23:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 00:23:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2018-04-12 00:23:32,307 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 9 [2018-04-12 00:23:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:32,308 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2018-04-12 00:23:32,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:23:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2018-04-12 00:23:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:23:32,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:32,309 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:23:32,309 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-12 00:23:32,310 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-12 00:23:32,328 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:32,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:32,360 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-12 00:23:32,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:23:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:23:32,377 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:32,420 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-12 00:23:32,452 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:32,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-12 00:23:32,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:23:32,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:23:32,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:23:32,454 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 6 states. [2018-04-12 00:23:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:32,706 INFO L93 Difference]: Finished difference Result 254 states and 267 transitions. [2018-04-12 00:23:32,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:23:32,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-12 00:23:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:32,710 INFO L225 Difference]: With dead ends: 254 [2018-04-12 00:23:32,710 INFO L226 Difference]: Without dead ends: 244 [2018-04-12 00:23:32,711 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-12 00:23:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-12 00:23:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-04-12 00:23:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-12 00:23:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2018-04-12 00:23:32,728 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 9 [2018-04-12 00:23:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:32,728 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2018-04-12 00:23:32,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:23:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2018-04-12 00:23:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-12 00:23:32,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:32,729 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-12 00:23:32,730 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-12 00:23:32,730 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-12 00:23:32,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:32,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:32,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 00:23:32,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:32,808 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-12 00:23:32,811 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-12 00:23:32,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,818 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-12 00:23:32,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-12 00:23:32,828 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-12 00:23:32,830 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-12 00:23:32,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:32,833 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-12 00:23:32,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-12 00:23:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:23:32,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:32,843 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-12 00:23:32,863 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:32,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:23:32,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:23:32,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:23:32,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:23:32,864 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 5 states. [2018-04-12 00:23:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:33,266 INFO L93 Difference]: Finished difference Result 397 states and 426 transitions. [2018-04-12 00:23:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:23:33,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-12 00:23:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:33,269 INFO L225 Difference]: With dead ends: 397 [2018-04-12 00:23:33,269 INFO L226 Difference]: Without dead ends: 396 [2018-04-12 00:23:33,270 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-12 00:23:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-12 00:23:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 230. [2018-04-12 00:23:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-12 00:23:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 250 transitions. [2018-04-12 00:23:33,287 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 250 transitions. Word has length 19 [2018-04-12 00:23:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:33,287 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 250 transitions. [2018-04-12 00:23:33,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:23:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 250 transitions. [2018-04-12 00:23:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-12 00:23:33,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:33,288 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-12 00:23:33,289 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-12 00:23:33,289 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-12 00:23:33,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:33,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:33,315 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-12 00:23:33,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:23:33,335 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-12 00:23:33,339 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-12 00:23:33,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,354 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-12 00:23:33,357 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-12 00:23:33,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,364 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-12 00:23:33,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-12 00:23:33,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-12 00:23:33,380 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-12 00:23:33,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,390 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-12 00:23:33,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-12 00:23:33,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,399 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-12 00:23:33,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-12 00:23:33,408 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-12 00:23:33,408 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:23:33,459 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:33,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:23:33,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:23:33,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:23:33,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:23:33,460 INFO L87 Difference]: Start difference. First operand 230 states and 250 transitions. Second operand 8 states. [2018-04-12 00:23:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:33,763 INFO L93 Difference]: Finished difference Result 432 states and 471 transitions. [2018-04-12 00:23:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:23:33,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-12 00:23:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:33,765 INFO L225 Difference]: With dead ends: 432 [2018-04-12 00:23:33,765 INFO L226 Difference]: Without dead ends: 431 [2018-04-12 00:23:33,765 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-12 00:23:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-12 00:23:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 229. [2018-04-12 00:23:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-12 00:23:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 249 transitions. [2018-04-12 00:23:33,775 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 249 transitions. Word has length 19 [2018-04-12 00:23:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:33,775 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 249 transitions. [2018-04-12 00:23:33,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:23:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 249 transitions. [2018-04-12 00:23:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 00:23:33,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:33,776 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-12 00:23:33,776 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-12 00:23:33,776 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-12 00:23:33,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:33,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:33,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:33,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:33,832 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-12 00:23:33,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-12 00:23:33,856 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-12 00:23:33,858 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-12 00:23:33,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,864 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-12 00:23:33,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-12 00:23:33,885 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-12 00:23:33,887 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-12 00:23:33,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,897 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-12 00:23:33,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-12 00:23:33,924 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-12 00:23:33,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:23:33,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,936 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-12 00:23:33,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:33,947 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-12 00:23:33,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-12 00:23:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:23:33,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:34,029 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-12 00:23:34,048 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-12 00:23:34,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,069 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-12 00:23:34,071 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-12 00:23:34,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,075 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-12 00:23:34,079 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-12 00:23:34,079 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,082 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,107 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-12 00:23:34,122 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-12 00:23:34,122 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-12 00:23:34,178 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:34,179 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-12 00:23:34,185 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-12 00:23:34,205 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:34,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-12 00:23:34,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 00:23:34,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 00:23:34,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-12 00:23:34,206 INFO L87 Difference]: Start difference. First operand 229 states and 249 transitions. Second operand 14 states. [2018-04-12 00:23:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:34,964 INFO L93 Difference]: Finished difference Result 400 states and 427 transitions. [2018-04-12 00:23:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 00:23:34,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-04-12 00:23:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:34,966 INFO L225 Difference]: With dead ends: 400 [2018-04-12 00:23:34,966 INFO L226 Difference]: Without dead ends: 399 [2018-04-12 00:23:34,966 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-12 00:23:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-12 00:23:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 228. [2018-04-12 00:23:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-12 00:23:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-12 00:23:34,977 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 22 [2018-04-12 00:23:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:34,977 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-12 00:23:34,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 00:23:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-12 00:23:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 00:23:34,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:34,978 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-12 00:23:34,978 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-12 00:23:34,978 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-12 00:23:34,984 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:34,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:35,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:35,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:35,006 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-12 00:23:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,010 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-12 00:23:35,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-12 00:23:35,024 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-12 00:23:35,026 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-12 00:23:35,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,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, 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-12 00:23:35,037 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-12 00:23:35,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,043 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-12 00:23:35,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-12 00:23:35,070 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-12 00:23:35,075 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-12 00:23:35,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,098 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-12 00:23:35,102 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-12 00:23:35,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,118 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-12 00:23:35,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-12 00:23:35,140 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-12 00:23:35,144 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-12 00:23:35,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,154 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-12 00:23:35,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,174 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-12 00:23:35,176 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-12 00:23:35,177 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,182 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-12 00:23:35,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,199 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-12 00:23:35,199 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-12 00:23:35,215 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-12 00:23:35,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:35,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:23:35,355 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-12 00:23:35,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,371 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-12 00:23:35,372 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-12 00:23:35,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-12 00:23:35,380 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-12 00:23:35,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,394 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-12 00:23:35,426 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-12 00:23:35,443 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-12 00:23:35,443 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,451 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-12 00:23:35,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-12 00:23:35,454 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,456 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,462 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-12 00:23:35,533 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-12 00:23:35,557 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-12 00:23:35,557 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,563 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-12 00:23:35,565 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-12 00:23:35,565 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,566 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,570 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-12 00:23:35,572 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-12 00:23:35,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 11 treesize of output 10 [2018-04-12 00:23:35,586 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,591 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-12 00:23:35,593 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-12 00:23:35,593 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,594 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,598 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-12 00:23:35,602 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-12 00:23:35,616 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-12 00:23:35,616 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,621 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-12 00:23:35,623 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-12 00:23:35,623 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,624 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,626 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-12 00:23:35,650 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-12 00:23:35,650 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-12 00:23:35,680 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-12 00:23:35,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-12 00:23:35,693 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:23:35,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:35,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-12 00:23:35,697 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-12 00:23:35,717 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:35,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-12 00:23:35,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 00:23:35,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 00:23:35,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-12 00:23:35,719 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 14 states. [2018-04-12 00:23:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:36,596 INFO L93 Difference]: Finished difference Result 402 states and 429 transitions. [2018-04-12 00:23:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 00:23:36,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-04-12 00:23:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:36,599 INFO L225 Difference]: With dead ends: 402 [2018-04-12 00:23:36,599 INFO L226 Difference]: Without dead ends: 401 [2018-04-12 00:23:36,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-12 00:23:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-12 00:23:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 227. [2018-04-12 00:23:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 00:23:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2018-04-12 00:23:36,609 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 22 [2018-04-12 00:23:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:36,609 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2018-04-12 00:23:36,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 00:23:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2018-04-12 00:23:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 00:23:36,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:36,610 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-12 00:23:36,611 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-12 00:23:36,611 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-12 00:23:36,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:36,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:36,668 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-12 00:23:36,671 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-12 00:23:36,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,680 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-12 00:23:36,682 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-12 00:23:36,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 00:23:36,699 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-12 00:23:36,702 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-12 00:23:36,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,713 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-12 00:23:36,715 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-12 00:23:36,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,719 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-12 00:23:36,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-12 00:23:36,729 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-12 00:23:36,729 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:36,746 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-12 00:23:36,766 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:36,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:23:36,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:23:36,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:23:36,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:23:36,767 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand 5 states. [2018-04-12 00:23:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:36,904 INFO L93 Difference]: Finished difference Result 539 states and 584 transitions. [2018-04-12 00:23:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:23:36,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-12 00:23:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:36,906 INFO L225 Difference]: With dead ends: 539 [2018-04-12 00:23:36,907 INFO L226 Difference]: Without dead ends: 343 [2018-04-12 00:23:36,909 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-12 00:23:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-12 00:23:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-04-12 00:23:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-12 00:23:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2018-04-12 00:23:36,920 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 32 [2018-04-12 00:23:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:36,920 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2018-04-12 00:23:36,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:23:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2018-04-12 00:23:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 00:23:36,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:36,922 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-12 00:23:36,922 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-12 00:23:36,922 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-12 00:23:36,929 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:36,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:36,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:36,981 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-12 00:23:36,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:23:36,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:36,994 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-12 00:23:36,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 00:23:37,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-12 00:23:37,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:37,095 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,096 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2018-04-12 00:23:37,104 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-12 00:23:37,124 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:37,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:23:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:23:37,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:23:37,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:23:37,125 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 8 states. [2018-04-12 00:23:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:37,405 INFO L93 Difference]: Finished difference Result 313 states and 335 transitions. [2018-04-12 00:23:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 00:23:37,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-12 00:23:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:37,407 INFO L225 Difference]: With dead ends: 313 [2018-04-12 00:23:37,407 INFO L226 Difference]: Without dead ends: 299 [2018-04-12 00:23:37,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:23:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-12 00:23:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2018-04-12 00:23:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-12 00:23:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 287 transitions. [2018-04-12 00:23:37,417 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 287 transitions. Word has length 34 [2018-04-12 00:23:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:37,417 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 287 transitions. [2018-04-12 00:23:37,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:23:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 287 transitions. [2018-04-12 00:23:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 00:23:37,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:37,419 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-12 00:23:37,419 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-12 00:23:37,419 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-12 00:23:37,426 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:37,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:37,448 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-12 00:23:37,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 00:23:37,459 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-12 00:23:37,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,468 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-12 00:23:37,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-12 00:23:37,473 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-12 00:23:37,475 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-12 00:23:37,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,487 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-12 00:23:37,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:23:37,498 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-12 00:23:37,498 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:37,522 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-12 00:23:37,542 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:37,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:23:37,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:23:37,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:23:37,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:23:37,543 INFO L87 Difference]: Start difference. First operand 255 states and 287 transitions. Second operand 6 states. [2018-04-12 00:23:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:37,781 INFO L93 Difference]: Finished difference Result 385 states and 438 transitions. [2018-04-12 00:23:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:23:37,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-12 00:23:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:37,822 INFO L225 Difference]: With dead ends: 385 [2018-04-12 00:23:37,822 INFO L226 Difference]: Without dead ends: 382 [2018-04-12 00:23:37,822 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-12 00:23:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-12 00:23:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 252. [2018-04-12 00:23:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-12 00:23:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-04-12 00:23:37,835 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 38 [2018-04-12 00:23:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:37,835 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-04-12 00:23:37,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:23:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-04-12 00:23:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 00:23:37,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:37,837 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-12 00:23:37,837 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-12 00:23:37,837 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-12 00:23:37,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:37,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:37,877 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-12 00:23:37,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:23:37,894 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-12 00:23:37,895 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-12 00:23:37,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,904 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-12 00:23:37,905 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-12 00:23:37,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,911 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-12 00:23:37,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 00:23:37,918 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-12 00:23:37,920 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-12 00:23:37,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,927 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-12 00:23:37,929 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-12 00:23:37,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:37,933 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-12 00:23:37,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-12 00:23:37,945 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-12 00:23:37,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:37,983 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-12 00:23:38,015 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:38,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-12 00:23:38,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 00:23:38,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 00:23:38,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:23:38,016 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 10 states. [2018-04-12 00:23:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:38,464 INFO L93 Difference]: Finished difference Result 420 states and 478 transitions. [2018-04-12 00:23:38,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 00:23:38,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-12 00:23:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:38,466 INFO L225 Difference]: With dead ends: 420 [2018-04-12 00:23:38,466 INFO L226 Difference]: Without dead ends: 413 [2018-04-12 00:23:38,467 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-12 00:23:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-12 00:23:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 245. [2018-04-12 00:23:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-12 00:23:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2018-04-12 00:23:38,475 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 38 [2018-04-12 00:23:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:38,476 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2018-04-12 00:23:38,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 00:23:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2018-04-12 00:23:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 00:23:38,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:38,477 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-12 00:23:38,477 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-12 00:23:38,477 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-12 00:23:38,485 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:38,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:23:38,584 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:38,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-12 00:23:38,643 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:38,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2018-04-12 00:23:38,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 00:23:38,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 00:23:38,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-12 00:23:38,644 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand 9 states. [2018-04-12 00:23:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:38,939 INFO L93 Difference]: Finished difference Result 283 states and 300 transitions. [2018-04-12 00:23:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 00:23:38,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-12 00:23:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:38,941 INFO L225 Difference]: With dead ends: 283 [2018-04-12 00:23:38,941 INFO L226 Difference]: Without dead ends: 282 [2018-04-12 00:23:38,941 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-04-12 00:23:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-12 00:23:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 245. [2018-04-12 00:23:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-12 00:23:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2018-04-12 00:23:38,952 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 41 [2018-04-12 00:23:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:38,953 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2018-04-12 00:23:38,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 00:23:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2018-04-12 00:23:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 00:23:38,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:38,954 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-12 00:23:38,954 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-12 00:23:38,954 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-12 00:23:38,960 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:38,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:39,010 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-12 00:23:39,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:39,021 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-12 00:23:39,040 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:39,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-12 00:23:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:23:39,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:23:39,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:23:39,041 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand 5 states. [2018-04-12 00:23:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:39,069 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-04-12 00:23:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 00:23:39,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 00:23:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:39,070 INFO L225 Difference]: With dead ends: 256 [2018-04-12 00:23:39,070 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 00:23:39,070 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-12 00:23:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 00:23:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2018-04-12 00:23:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-12 00:23:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2018-04-12 00:23:39,082 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 43 [2018-04-12 00:23:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:39,082 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2018-04-12 00:23:39,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:23:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2018-04-12 00:23:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 00:23:39,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:39,083 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-12 00:23:39,083 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-12 00:23:39,084 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-12 00:23:39,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:39,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:39,166 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-12 00:23:39,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:39,171 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-12 00:23:39,191 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:39,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:23:39,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 00:23:39,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 00:23:39,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 00:23:39,192 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand 3 states. [2018-04-12 00:23:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:39,253 INFO L93 Difference]: Finished difference Result 326 states and 364 transitions. [2018-04-12 00:23:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 00:23:39,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-04-12 00:23:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:39,255 INFO L225 Difference]: With dead ends: 326 [2018-04-12 00:23:39,255 INFO L226 Difference]: Without dead ends: 255 [2018-04-12 00:23:39,256 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-12 00:23:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-12 00:23:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2018-04-12 00:23:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-12 00:23:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 273 transitions. [2018-04-12 00:23:39,266 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 273 transitions. Word has length 50 [2018-04-12 00:23:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:39,267 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 273 transitions. [2018-04-12 00:23:39,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 00:23:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 273 transitions. [2018-04-12 00:23:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 00:23:39,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:39,268 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-12 00:23:39,268 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-12 00:23:39,268 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-12 00:23:39,277 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:39,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:39,310 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-12 00:23:39,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:39,329 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-12 00:23:39,332 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-12 00:23:39,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,340 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-12 00:23:39,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-12 00:23:39,349 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-12 00:23:39,351 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-12 00:23:39,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,354 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-12 00:23:39,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-12 00:23:39,360 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-12 00:23:39,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:39,366 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-12 00:23:39,397 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:39,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:23:39,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:23:39,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:23:39,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:23:39,398 INFO L87 Difference]: Start difference. First operand 245 states and 273 transitions. Second operand 5 states. [2018-04-12 00:23:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:39,562 INFO L93 Difference]: Finished difference Result 399 states and 446 transitions. [2018-04-12 00:23:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:23:39,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-12 00:23:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:39,563 INFO L225 Difference]: With dead ends: 399 [2018-04-12 00:23:39,563 INFO L226 Difference]: Without dead ends: 398 [2018-04-12 00:23:39,564 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-12 00:23:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-12 00:23:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2018-04-12 00:23:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-12 00:23:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2018-04-12 00:23:39,575 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 51 [2018-04-12 00:23:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:39,575 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2018-04-12 00:23:39,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:23:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2018-04-12 00:23:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 00:23:39,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:39,576 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-12 00:23:39,576 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-12 00:23:39,576 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-12 00:23:39,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:39,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:39,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 00:23:39,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:23:39,615 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-12 00:23:39,617 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-12 00:23:39,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 00:23:39,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 10 treesize of output 9 [2018-04-12 00:23:39,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,630 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-12 00:23:39,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-12 00:23:39,636 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-12 00:23:39,637 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-12 00:23:39,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 00:23:39,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-12 00:23:39,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:39,647 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-12 00:23:39,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-12 00:23:39,652 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-12 00:23:39,652 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:39,679 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-12 00:23:39,699 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:39,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:23:39,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:23:39,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:23:39,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:23:39,699 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand 8 states. [2018-04-12 00:23:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:40,496 INFO L93 Difference]: Finished difference Result 437 states and 491 transitions. [2018-04-12 00:23:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:23:40,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-04-12 00:23:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:40,498 INFO L225 Difference]: With dead ends: 437 [2018-04-12 00:23:40,498 INFO L226 Difference]: Without dead ends: 436 [2018-04-12 00:23:40,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:23:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-12 00:23:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 243. [2018-04-12 00:23:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-12 00:23:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2018-04-12 00:23:40,513 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 51 [2018-04-12 00:23:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:40,513 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2018-04-12 00:23:40,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:23:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2018-04-12 00:23:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 00:23:40,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:40,514 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-12 00:23:40,514 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-12 00:23:40,515 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-12 00:23:40,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:40,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:40,563 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-12 00:23:40,565 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-12 00:23:40,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 00:23:40,577 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-12 00:23:40,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-04-12 00:23:40,619 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-12 00:23:40,621 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-12 00:23:40,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 00:23:40,635 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-12 00:23:40,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:40,643 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-12 00:23:40,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:7 [2018-04-12 00:23:40,664 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-12 00:23:40,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:40,698 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-12 00:23:40,729 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:40,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 11 [2018-04-12 00:23:40,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:23:40,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:23:40,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:23:40,730 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand 11 states. [2018-04-12 00:23:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:41,194 INFO L93 Difference]: Finished difference Result 573 states and 631 transitions. [2018-04-12 00:23:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 00:23:41,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-12 00:23:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:41,197 INFO L225 Difference]: With dead ends: 573 [2018-04-12 00:23:41,197 INFO L226 Difference]: Without dead ends: 425 [2018-04-12 00:23:41,198 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-12 00:23:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-12 00:23:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 299. [2018-04-12 00:23:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-12 00:23:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 331 transitions. [2018-04-12 00:23:41,217 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 331 transitions. Word has length 52 [2018-04-12 00:23:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:41,217 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 331 transitions. [2018-04-12 00:23:41,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:23:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 331 transitions. [2018-04-12 00:23:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 00:23:41,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:41,219 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-12 00:23:41,219 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-12 00:23:41,219 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-12 00:23:41,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:41,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:41,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 6 treesize of output 5 [2018-04-12 00:23:41,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:41,273 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-12 00:23:41,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 00:23:41,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,280 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-12 00:23:41,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-12 00:23:41,286 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-12 00:23:41,287 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-12 00:23:41,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,290 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-12 00:23:41,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:23:41,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:41,302 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-12 00:23:41,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-12 00:23:41,335 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-12 00:23:41,337 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-12 00:23:41,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-12 00:23:41,375 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-12 00:23:41,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 14 treesize of output 13 [2018-04-12 00:23:41,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,398 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-12 00:23:41,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-12 00:23:41,422 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-12 00:23:41,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 00:23:41,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,444 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-12 00:23:41,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,451 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-12 00:23:41,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-12 00:23:41,469 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-12 00:23:41,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:41,532 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-12 00:23:41,545 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-12 00:23:41,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,558 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-12 00:23:41,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 18 treesize of output 5 [2018-04-12 00:23:41,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,563 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-12 00:23:41,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-12 00:23:41,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,567 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:41,577 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-12 00:23:41,590 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-12 00:23:41,590 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-12 00:23:41,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-12 00:23:41,681 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:41,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-12 00:23:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 00:23:41,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 00:23:41,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-04-12 00:23:41,682 INFO L87 Difference]: Start difference. First operand 299 states and 331 transitions. Second operand 20 states. [2018-04-12 00:23:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:42,568 INFO L93 Difference]: Finished difference Result 462 states and 513 transitions. [2018-04-12 00:23:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 00:23:42,568 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-12 00:23:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:42,570 INFO L225 Difference]: With dead ends: 462 [2018-04-12 00:23:42,570 INFO L226 Difference]: Without dead ends: 461 [2018-04-12 00:23:42,570 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-12 00:23:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-12 00:23:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 298. [2018-04-12 00:23:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-12 00:23:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 330 transitions. [2018-04-12 00:23:42,591 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 330 transitions. Word has length 54 [2018-04-12 00:23:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:42,591 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 330 transitions. [2018-04-12 00:23:42,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 00:23:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 330 transitions. [2018-04-12 00:23:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 00:23:42,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:42,606 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-12 00:23:42,606 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-12 00:23:42,606 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-12 00:23:42,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:42,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:42,638 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-12 00:23:42,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:23:42,643 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-12 00:23:42,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 00:23:42,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-12 00:23:42,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-12 00:23:42,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 13 treesize of output 5 [2018-04-12 00:23:42,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,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-12 00:23:42,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:23:42,665 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-12 00:23:42,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:42,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:42,673 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-12 00:23:42,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-12 00:23:42,688 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-12 00:23:42,692 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-12 00:23:42,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,713 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-12 00:23:42,716 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-12 00:23:42,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,723 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-12 00:23:42,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-12 00:23:42,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 00:23:42,751 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-12 00:23:42,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,768 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-12 00:23:42,769 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-12 00:23:42,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,780 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-12 00:23:42,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-12 00:23:42,806 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-12 00:23:42,808 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-12 00:23:42,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,816 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-12 00:23:42,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,830 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-12 00:23:42,832 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-12 00:23:42,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,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-12 00:23:42,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:42,841 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-12 00:23:42,842 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-12 00:23:42,855 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-12 00:23:42,856 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:42,999 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-12 00:23:43,016 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-12 00:23:43,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,034 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-12 00:23:43,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-12 00:23:43,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,041 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-12 00:23:43,045 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-12 00:23:43,046 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,048 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,069 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-12 00:23:43,107 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-12 00:23:43,128 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-12 00:23:43,129 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,140 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-12 00:23:43,142 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-12 00:23:43,143 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,144 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,147 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-12 00:23:43,150 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-12 00:23:43,175 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-12 00:23:43,176 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,182 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-12 00:23:43,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-12 00:23:43,190 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,192 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,196 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-12 00:23:43,199 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-12 00:23:43,216 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-12 00:23:43,216 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,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 24 treesize of output 20 [2018-04-12 00:23:43,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-12 00:23:43,224 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,225 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,228 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-12 00:23:43,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-12 00:23:43,265 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-12 00:23:43,265 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,273 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-12 00:23:43,275 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-12 00:23:43,275 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,277 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,282 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-12 00:23:43,302 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-12 00:23:43,303 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-12 00:23:43,337 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-12 00:23:43,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:43,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-12 00:23:43,391 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-12 00:23:43,411 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:43,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-12 00:23:43,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 00:23:43,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 00:23:43,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-12 00:23:43,412 INFO L87 Difference]: Start difference. First operand 298 states and 330 transitions. Second operand 20 states. [2018-04-12 00:23:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:44,217 INFO L93 Difference]: Finished difference Result 461 states and 512 transitions. [2018-04-12 00:23:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 00:23:44,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-12 00:23:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:44,219 INFO L225 Difference]: With dead ends: 461 [2018-04-12 00:23:44,219 INFO L226 Difference]: Without dead ends: 460 [2018-04-12 00:23:44,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 00:23:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-04-12 00:23:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 297. [2018-04-12 00:23:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-12 00:23:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 329 transitions. [2018-04-12 00:23:44,232 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 329 transitions. Word has length 54 [2018-04-12 00:23:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:44,232 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 329 transitions. [2018-04-12 00:23:44,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 00:23:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 329 transitions. [2018-04-12 00:23:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 00:23:44,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:44,233 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-12 00:23:44,233 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-12 00:23:44,233 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-12 00:23:44,239 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:44,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:44,267 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-12 00:23:44,269 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-12 00:23:44,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,287 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-12 00:23:44,288 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-12 00:23:44,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-12 00:23:44,307 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-12 00:23:44,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,310 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-12 00:23:44,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,324 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-12 00:23:44,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,327 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-12 00:23:44,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-12 00:23:44,363 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-12 00:23:44,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,366 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-12 00:23:44,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,375 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-12 00:23:44,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,377 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-12 00:23:44,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,384 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-12 00:23:44,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-12 00:23:44,406 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-12 00:23:44,407 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:44,441 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-12 00:23:44,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:23:44,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-04-12 00:23:44,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:23:44,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:23:44,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:23:44,462 INFO L87 Difference]: Start difference. First operand 297 states and 329 transitions. Second operand 11 states. [2018-04-12 00:23:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:23:44,846 INFO L93 Difference]: Finished difference Result 577 states and 624 transitions. [2018-04-12 00:23:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 00:23:44,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-04-12 00:23:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:23:44,850 INFO L225 Difference]: With dead ends: 577 [2018-04-12 00:23:44,850 INFO L226 Difference]: Without dead ends: 458 [2018-04-12 00:23:44,851 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-12 00:23:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-12 00:23:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359. [2018-04-12 00:23:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-12 00:23:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 403 transitions. [2018-04-12 00:23:44,892 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 403 transitions. Word has length 55 [2018-04-12 00:23:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:23:44,893 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 403 transitions. [2018-04-12 00:23:44,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:23:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 403 transitions. [2018-04-12 00:23:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 00:23:44,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:23:44,894 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-12 00:23:44,894 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-12 00:23:44,894 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-12 00:23:44,907 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:23:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:23:44,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:23:44,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:23:44,977 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-12 00:23:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:44,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 00:23:45,006 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-12 00:23:45,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 00:23:45,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,017 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-12 00:23:45,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-12 00:23:45,057 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-12 00:23:45,059 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-12 00:23:45,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,072 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-12 00:23:45,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-12 00:23:45,124 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-12 00:23:45,127 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-12 00:23:45,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:45,142 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-12 00:23:45,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:61 [2018-04-12 00:23:51,172 WARN L151 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-04-12 00:23:51,208 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-12 00:23:51,210 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-12 00:23:51,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,215 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-12 00:23:51,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,222 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-12 00:23:51,223 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:15 [2018-04-12 00:23:51,275 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-12 00:23:51,276 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:23:51,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 41 treesize of output 33 [2018-04-12 00:23:51,469 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-12 00:23:51,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,482 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-12 00:23:51,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-12 00:23:51,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,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 17 [2018-04-12 00:23:51,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 8 treesize of output 1 [2018-04-12 00:23:51,498 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:23:51,511 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-12 00:23:51,524 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-12 00:23:51,524 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-04-12 00:23:51,565 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-12 00:23:51,584 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:23:51,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2018-04-12 00:23:51,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 00:23:51,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 00:23:51,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=415, Unknown=2, NotChecked=0, Total=506 [2018-04-12 00:23:51,585 INFO L87 Difference]: Start difference. First operand 359 states and 403 transitions. Second operand 23 states. [2018-04-12 00:24:06,295 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 38 DAG size of output 34 [2018-04-12 00:24:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:24:13,493 INFO L93 Difference]: Finished difference Result 634 states and 691 transitions. [2018-04-12 00:24:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 00:24:13,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-12 00:24:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:24:13,495 INFO L225 Difference]: With dead ends: 634 [2018-04-12 00:24:13,495 INFO L226 Difference]: Without dead ends: 631 [2018-04-12 00:24:13,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=529, Invalid=1532, Unknown=9, NotChecked=0, Total=2070 [2018-04-12 00:24:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-04-12 00:24:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 367. [2018-04-12 00:24:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-12 00:24:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 410 transitions. [2018-04-12 00:24:13,524 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 410 transitions. Word has length 57 [2018-04-12 00:24:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:24:13,524 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 410 transitions. [2018-04-12 00:24:13,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 00:24:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 410 transitions. [2018-04-12 00:24:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 00:24:13,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:24:13,525 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-12 00:24:13,525 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-12 00:24:13,525 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-12 00:24:13,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:24:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:24:13,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:24:13,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:24:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:24:13,563 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-12 00:24:13,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 00:24:13,579 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-12 00:24:13,581 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-12 00:24:13,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,590 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-12 00:24:13,592 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-12 00:24:13,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,599 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-12 00:24:13,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2018-04-12 00:24:13,627 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-12 00:24:13,629 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-12 00:24:13,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,645 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-12 00:24:13,647 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-12 00:24:13,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,658 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-12 00:24:13,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 [2018-04-12 00:24:13,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 00:24:13,717 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-12 00:24:13,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,750 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-12 00:24:13,753 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-12 00:24:13,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,774 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-12 00:24:13,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:124, output treesize:104 [2018-04-12 00:24:13,852 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-12 00:24:13,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:24:13,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,875 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-12 00:24:13,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,893 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-12 00:24:13,896 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-12 00:24:13,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,902 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-12 00:24:13,902 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:13,913 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-12 00:24:13,913 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:96, output treesize:11 [2018-04-12 00:24:13,966 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-12 00:24:13,966 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:24:14,044 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-12 00:24:14,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 00:24:14,056 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-12 00:24:14,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:24:14,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-04-12 00:24:14,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-04-12 00:24:14,814 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-12 00:24:14,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,827 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-12 00:24:14,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:24:14,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,834 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-12 00:24:14,861 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-12 00:24:14,880 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-12 00:24:14,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,894 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-12 00:24:14,895 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-12 00:24:14,896 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,897 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,902 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-12 00:24:14,928 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-12 00:24:14,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 00:24:14,945 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,952 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-12 00:24:14,953 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-12 00:24:14,953 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,954 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:14,958 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-12 00:24:14,975 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-12 00:24:14,975 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:134, output treesize:39 [2018-04-12 00:24:15,047 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-12 00:24:15,067 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:24:15,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 9] imperfect sequences [] total 21 [2018-04-12 00:24:15,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 00:24:15,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 00:24:15,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-04-12 00:24:15,068 INFO L87 Difference]: Start difference. First operand 367 states and 410 transitions. Second operand 22 states. [2018-04-12 00:24:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:24:16,880 INFO L93 Difference]: Finished difference Result 728 states and 782 transitions. [2018-04-12 00:24:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 00:24:16,880 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-04-12 00:24:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:24:16,883 INFO L225 Difference]: With dead ends: 728 [2018-04-12 00:24:16,883 INFO L226 Difference]: Without dead ends: 725 [2018-04-12 00:24:16,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=618, Invalid=2034, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 00:24:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-12 00:24:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 371. [2018-04-12 00:24:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-12 00:24:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 411 transitions. [2018-04-12 00:24:16,903 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 411 transitions. Word has length 57 [2018-04-12 00:24:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:24:16,903 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 411 transitions. [2018-04-12 00:24:16,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 00:24:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 411 transitions. [2018-04-12 00:24:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-12 00:24:16,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:24:16,904 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-12 00:24:16,904 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-12 00:24:16,904 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-12 00:24:16,913 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:24:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:24:16,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:24:16,945 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-12 00:24:16,947 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-12 00:24:16,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 00:24:16,959 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-12 00:24:16,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 00:24:16,980 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-12 00:24:16,982 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-12 00:24:16,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,988 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-12 00:24:16,989 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-12 00:24:16,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:16,993 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-12 00:24:16,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-12 00:24:17,009 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-12 00:24:17,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:24:17,024 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-12 00:24:17,055 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:24:17,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:24:17,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:24:17,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:24:17,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:24:17,056 INFO L87 Difference]: Start difference. First operand 371 states and 411 transitions. Second operand 5 states. [2018-04-12 00:24:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:24:17,168 INFO L93 Difference]: Finished difference Result 456 states and 504 transitions. [2018-04-12 00:24:17,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:24:17,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-04-12 00:24:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:24:17,170 INFO L225 Difference]: With dead ends: 456 [2018-04-12 00:24:17,170 INFO L226 Difference]: Without dead ends: 392 [2018-04-12 00:24:17,171 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-12 00:24:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-12 00:24:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2018-04-12 00:24:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-12 00:24:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 425 transitions. [2018-04-12 00:24:17,195 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 425 transitions. Word has length 64 [2018-04-12 00:24:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:24:17,196 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 425 transitions. [2018-04-12 00:24:17,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:24:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 425 transitions. [2018-04-12 00:24:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-12 00:24:17,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:24:17,197 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-12 00:24:17,197 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-12 00:24:17,197 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-12 00:24:17,206 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:24:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:24:17,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:24:17,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-12 00:24:17,333 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-12 00:24:17,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 00:24:17,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:24:17,367 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-12 00:24:17,369 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-12 00:24:17,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,375 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-12 00:24:17,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 00:24:17,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-12 00:24:17,406 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-12 00:24:17,406 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-12 00:24:17,413 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:24:17,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-12 00:24:17,441 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-12 00:24:17,441 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,445 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,446 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-12 00:24:17,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:24:17,448 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,451 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,474 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-12 00:24:17,474 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:77, output treesize:26 [2018-04-12 00:24:17,526 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-12 00:24:17,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:24:17,676 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-12 00:24:17,679 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-12 00:24:17,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,700 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-12 00:24:17,702 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-12 00:24:17,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,721 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-12 00:24:17,723 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-12 00:24:17,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,727 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:24:17,740 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-12 00:24:17,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:17,753 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-12 00:24:17,753 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:7 [2018-04-12 00:24:17,770 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-12 00:24:17,790 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:24:17,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2018-04-12 00:24:17,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 00:24:17,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 00:24:17,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-04-12 00:24:17,791 INFO L87 Difference]: Start difference. First operand 385 states and 425 transitions. Second operand 18 states. [2018-04-12 00:24:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:24:18,759 INFO L93 Difference]: Finished difference Result 589 states and 639 transitions. [2018-04-12 00:24:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 00:24:18,759 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-12 00:24:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:24:18,760 INFO L225 Difference]: With dead ends: 589 [2018-04-12 00:24:18,761 INFO L226 Difference]: Without dead ends: 510 [2018-04-12 00:24:18,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-04-12 00:24:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-04-12 00:24:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 408. [2018-04-12 00:24:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-12 00:24:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 449 transitions. [2018-04-12 00:24:18,793 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 449 transitions. Word has length 69 [2018-04-12 00:24:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:24:18,793 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 449 transitions. [2018-04-12 00:24:18,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 00:24:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 449 transitions. [2018-04-12 00:24:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-12 00:24:18,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:24:18,795 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-12 00:24:18,795 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-12 00:24:18,795 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-12 00:24:18,801 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:24:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:24:18,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:24:18,828 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-12 00:24:18,830 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-12 00:24:18,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,837 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-12 00:24:18,838 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-12 00:24:18,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 00:24:18,925 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-12 00:24:18,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:24:18,933 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-12 00:24:18,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:18,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 24 treesize of output 18 [2018-04-12 00:24:18,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:24:19,000 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-12 00:24:19,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:24:19,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:24:19,016 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-12 00:24:19,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-12 00:24:19,047 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-12 00:24:19,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:24:19,108 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-12 00:24:19,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:24:19,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-04-12 00:24:19,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 00:24:19,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 00:24:19,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-12 00:24:19,129 INFO L87 Difference]: Start difference. First operand 408 states and 449 transitions. Second operand 14 states. [2018-04-12 00:24:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:24:19,735 INFO L93 Difference]: Finished difference Result 703 states and 750 transitions. [2018-04-12 00:24:19,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 00:24:19,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-04-12 00:24:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:24:19,737 INFO L225 Difference]: With dead ends: 703 [2018-04-12 00:24:19,737 INFO L226 Difference]: Without dead ends: 660 [2018-04-12 00:24:19,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2018-04-12 00:24:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-04-12 00:24:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 445. [2018-04-12 00:24:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-12 00:24:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 493 transitions. [2018-04-12 00:24:19,760 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 493 transitions. Word has length 69 [2018-04-12 00:24:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:24:19,760 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 493 transitions. [2018-04-12 00:24:19,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 00:24:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 493 transitions. [2018-04-12 00:24:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-12 00:24:19,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:24:19,761 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-12 00:24:19,761 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-12 00:24:19,762 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-12 00:24:19,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:24:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 00:24:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 00:24:19,865 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 00:24:19,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 12:24:19 BoogieIcfgContainer [2018-04-12 00:24:19,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 00:24:19,916 INFO L168 Benchmark]: Toolchain (without parser) took 49686.83 ms. Allocated memory was 309.9 MB in the beginning and 676.3 MB in the end (delta: 366.5 MB). Free memory was 246.2 MB in the beginning and 354.4 MB in the end (delta: -108.2 MB). Peak memory consumption was 258.3 MB. Max. memory is 5.3 GB. [2018-04-12 00:24:19,917 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 309.9 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 00:24:19,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.87 ms. Allocated memory is still 309.9 MB. Free memory was 246.2 MB in the beginning and 217.7 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-04-12 00:24:19,917 INFO L168 Benchmark]: Boogie Preprocessor took 71.84 ms. Allocated memory is still 309.9 MB. Free memory was 217.7 MB in the beginning and 214.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-12 00:24:19,917 INFO L168 Benchmark]: RCFGBuilder took 845.11 ms. Allocated memory was 309.9 MB in the beginning and 475.0 MB in the end (delta: 165.2 MB). Free memory was 214.7 MB in the beginning and 381.0 MB in the end (delta: -166.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-12 00:24:19,917 INFO L168 Benchmark]: TraceAbstraction took 48413.97 ms. Allocated memory was 475.0 MB in the beginning and 676.3 MB in the end (delta: 201.3 MB). Free memory was 381.0 MB in the beginning and 354.4 MB in the end (delta: 26.5 MB). Peak memory consumption was 227.8 MB. Max. memory is 5.3 GB. [2018-04-12 00:24:19,919 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 309.9 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 350.87 ms. Allocated memory is still 309.9 MB. Free memory was 246.2 MB in the beginning and 217.7 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 71.84 ms. Allocated memory is still 309.9 MB. Free memory was 217.7 MB in the beginning and 214.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 845.11 ms. Allocated memory was 309.9 MB in the beginning and 475.0 MB in the end (delta: 165.2 MB). Free memory was 214.7 MB in the beginning and 381.0 MB in the end (delta: -166.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48413.97 ms. Allocated memory was 475.0 MB in the beginning and 676.3 MB in the end (delta: 201.3 MB). Free memory was 381.0 MB in the beginning and 354.4 MB in the end (delta: 26.5 MB). Peak memory consumption was 227.8 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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17:0}] [L993] COND FALSE !(0) VAL [list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17:0}] [L1012] COND FALSE !(0) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17:0}] [L1020] COND TRUE len == 0 VAL [end={25:0}, inner={17:0}, len=0, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17:0}] [L1021] len = 1 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 !(!(((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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17: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))={25:0}, malloc(sizeof(SLL))={17:0}] [L1027] inner = inner->inner VAL [end={25:0}, inner={0:0}, inner->inner={0:0}, len=1, list={25:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={17: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, 48.3s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 33.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5186 SDtfs, 14744 SDslu, 22126 SDs, 0 SdLazy, 11452 SolverSat, 660 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2204 GetRequests, 1795 SyntacticMatches, 9 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 29.1s 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.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 3113 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1079 NumberOfCodeBlocks, 1079 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1970 ConstructedInterpolants, 138 QuantifiedInterpolants, 1125997 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-12_00-24-19-925.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-12_00-24-19-925.csv Received shutdown request...