java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:34,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:34,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:34,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:34,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:34,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:34,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:34,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:34,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:34,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:34,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:34,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:34,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:34,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:34,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:34,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:34,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:34,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:34,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:34,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:34,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:34,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:34,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:34,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:34,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:34,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:34,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:34,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:34,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:34,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:34,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:34,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:34,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:34,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:34,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:34,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:34,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:34,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:34,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:34,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:34,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:34,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:01:34,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:34,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:34,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:34,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:34,235 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:34,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:34,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:34,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:34,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:34,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:34,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:34,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:34,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:34,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:34,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:34,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:34,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:34,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:34,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:34,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:34,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:34,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:34,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:34,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:34,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:34,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:34,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:34,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:34,284 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:34,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-09-20 13:01:34,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad864cd9d/301c3df9107c4e909c7b55df2c406fc5/FLAGaa300b69b [2019-09-20 13:01:34,894 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:34,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-09-20 13:01:34,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad864cd9d/301c3df9107c4e909c7b55df2c406fc5/FLAGaa300b69b [2019-09-20 13:01:35,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad864cd9d/301c3df9107c4e909c7b55df2c406fc5 [2019-09-20 13:01:35,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:01:35,155 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:01:35,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:35,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:01:35,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:01:35,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a2b2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35, skipping insertion in model container [2019-09-20 13:01:35,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,176 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:01:35,231 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:01:35,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:35,699 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:01:35,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:35,799 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:01:35,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35 WrapperNode [2019-09-20 13:01:35,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:35,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:01:35,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:01:35,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:01:35,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... [2019-09-20 13:01:35,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:01:35,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:01:35,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:01:35,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:01:35,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-20 13:01:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:01:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:01:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:01:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:01:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:01:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:01:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:01:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:01:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:01:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:01:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:01:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:01:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:01:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:01:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:01:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:01:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:01:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:01:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:01:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:01:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:01:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:01:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:01:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:01:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:01:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:01:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:01:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:01:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:01:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:01:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:01:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:01:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:01:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:01:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:01:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:01:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:01:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:01:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:01:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:01:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:01:36,613 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:01:36,614 INFO L283 CfgBuilder]: Removed 20 assume(true) statements. [2019-09-20 13:01:36,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:36 BoogieIcfgContainer [2019-09-20 13:01:36,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:01:36,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:01:36,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:01:36,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:01:36,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:01:35" (1/3) ... [2019-09-20 13:01:36,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7641bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:36, skipping insertion in model container [2019-09-20 13:01:36,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:35" (2/3) ... [2019-09-20 13:01:36,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7641bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:36, skipping insertion in model container [2019-09-20 13:01:36,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:36" (3/3) ... [2019-09-20 13:01:36,623 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2019-09-20 13:01:36,631 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:01:36,638 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-20 13:01:36,654 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-20 13:01:36,681 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:01:36,682 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:01:36,682 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:01:36,683 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:01:36,683 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:01:36,683 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:01:36,683 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:01:36,683 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:01:36,684 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:01:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-09-20 13:01:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:01:36,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:36,710 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:36,712 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1007014106, now seen corresponding path program 1 times [2019-09-20 13:01:36,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:36,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:36,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:01:36,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:01:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:01:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:36,890 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2019-09-20 13:01:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:36,922 INFO L93 Difference]: Finished difference Result 124 states and 196 transitions. [2019-09-20 13:01:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:01:36,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 13:01:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:36,934 INFO L225 Difference]: With dead ends: 124 [2019-09-20 13:01:36,934 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:01:36,937 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:01:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-20 13:01:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:01:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-20 13:01:36,971 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 10 [2019-09-20 13:01:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:36,972 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-20 13:01:36,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:01:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-20 13:01:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 13:01:36,973 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:36,973 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:36,973 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1170755113, now seen corresponding path program 1 times [2019-09-20 13:01:36,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:36,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:36,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:37,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:37,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:37,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:37,059 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 3 states. [2019-09-20 13:01:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,130 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2019-09-20 13:01:37,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:37,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-20 13:01:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,132 INFO L225 Difference]: With dead ends: 119 [2019-09-20 13:01:37,132 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 13:01:37,133 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 13:01:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-20 13:01:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:01:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-09-20 13:01:37,142 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2019-09-20 13:01:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,143 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-09-20 13:01:37,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-09-20 13:01:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:01:37,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,144 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,144 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1725322068, now seen corresponding path program 1 times [2019-09-20 13:01:37,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:01:37,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:37,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:37,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:37,260 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 4 states. [2019-09-20 13:01:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,400 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-09-20 13:01:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:37,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-20 13:01:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,402 INFO L225 Difference]: With dead ends: 103 [2019-09-20 13:01:37,402 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:01:37,402 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:01:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2019-09-20 13:01:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 13:01:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-09-20 13:01:37,412 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2019-09-20 13:01:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,412 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-09-20 13:01:37,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-09-20 13:01:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:01:37,413 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,413 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,414 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash -964262520, now seen corresponding path program 1 times [2019-09-20 13:01:37,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:37,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:37,733 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:01:37,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:37,929 INFO L375 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 [2019-09-20 13:01:37,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:37,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:37,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:37,981 INFO L375 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 11 treesize of output 15 [2019-09-20 13:01:37,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:38,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:38,023 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,034 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-09-20 13:01:38,068 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-09-20 13:01:38,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-09-20 13:01:38,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,160 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-09-20 13:01:38,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 149 [2019-09-20 13:01:38,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:38,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:38,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-09-20 13:01:38,231 INFO L567 ElimStorePlain]: treesize reduction 222, result has 30.0 percent of original size [2019-09-20 13:01:38,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,256 INFO L375 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 105 [2019-09-20 13:01:38,258 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,283 INFO L567 ElimStorePlain]: treesize reduction 58, result has 49.1 percent of original size [2019-09-20 13:01:38,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,284 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-09-20 13:01:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:38,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-20 13:01:38,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:01:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:01:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:38,434 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 12 states. [2019-09-20 13:01:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:39,406 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2019-09-20 13:01:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:01:39,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-09-20 13:01:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:39,410 INFO L225 Difference]: With dead ends: 154 [2019-09-20 13:01:39,410 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:01:39,411 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:01:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:01:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 75. [2019-09-20 13:01:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 13:01:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-09-20 13:01:39,421 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 22 [2019-09-20 13:01:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:39,422 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-09-20 13:01:39,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:01:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-09-20 13:01:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:01:39,426 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:39,426 INFO L407 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] [2019-09-20 13:01:39,426 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1597211810, now seen corresponding path program 1 times [2019-09-20 13:01:39,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:39,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:39,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:39,737 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:39,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 13:01:39,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:39,862 INFO L375 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 [2019-09-20 13:01:39,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:39,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,920 INFO L375 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 11 treesize of output 15 [2019-09-20 13:01:39,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:39,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:39,955 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,963 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-09-20 13:01:39,993 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-09-20 13:01:39,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-09-20 13:01:39,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,039 INFO L375 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 136 [2019-09-20 13:01:40,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,072 INFO L567 ElimStorePlain]: treesize reduction 58, result has 62.1 percent of original size [2019-09-20 13:01:40,118 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-09-20 13:01:40,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 122 [2019-09-20 13:01:40,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,121 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,140 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-09-20 13:01:40,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,141 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-09-20 13:01:40,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2019-09-20 13:01:40,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,239 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-09-20 13:01:40,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-09-20 13:01:40,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:9 [2019-09-20 13:01:40,269 INFO L375 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 7 [2019-09-20 13:01:40,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-20 13:01:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:40,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-20 13:01:40,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:01:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:01:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:01:40,281 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 14 states. [2019-09-20 13:01:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:41,153 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-09-20 13:01:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:01:41,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-09-20 13:01:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:41,155 INFO L225 Difference]: With dead ends: 103 [2019-09-20 13:01:41,156 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:01:41,157 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:01:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:01:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-09-20 13:01:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-09-20 13:01:41,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2019-09-20 13:01:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:41,168 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-09-20 13:01:41,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:01:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-09-20 13:01:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:01:41,169 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:41,169 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:41,169 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash -474324013, now seen corresponding path program 1 times [2019-09-20 13:01:41,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:41,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:41,478 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:41,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:41,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 13:01:41,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:41,583 INFO L375 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 [2019-09-20 13:01:41,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-09-20 13:01:41,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-09-20 13:01:41,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:01:41,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,679 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-09-20 13:01:41,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-09-20 13:01:41,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,706 INFO L375 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 25 treesize of output 13 [2019-09-20 13:01:41,707 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,718 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-09-20 13:01:41,754 INFO L375 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 23 treesize of output 22 [2019-09-20 13:01:41,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-09-20 13:01:41,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-20 13:01:41,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,838 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 6=[|v_#memory_int_39|]} [2019-09-20 13:01:41,842 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,924 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-09-20 13:01:41,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2019-09-20 13:01:41,926 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,939 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:34 [2019-09-20 13:01:41,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-09-20 13:01:41,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-09-20 13:01:42,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-09-20 13:01:42,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-09-20 13:01:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-09-20 13:01:42,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:01:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:01:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:42,097 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 16 states. [2019-09-20 13:01:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:43,941 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2019-09-20 13:01:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-20 13:01:43,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-09-20 13:01:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:43,944 INFO L225 Difference]: With dead ends: 244 [2019-09-20 13:01:43,945 INFO L226 Difference]: Without dead ends: 242 [2019-09-20 13:01:43,946 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2019-09-20 13:01:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-20 13:01:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 86. [2019-09-20 13:01:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-20 13:01:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-09-20 13:01:43,973 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 26 [2019-09-20 13:01:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:43,974 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-09-20 13:01:43,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:01:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-09-20 13:01:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:01:43,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:43,979 INFO L407 BasicCegarLoop]: trace histogram [3, 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] [2019-09-20 13:01:43,980 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1238565257, now seen corresponding path program 1 times [2019-09-20 13:01:43,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:43,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:43,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:43,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:44,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:44,478 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-20 13:01:44,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:44,593 INFO L375 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 [2019-09-20 13:01:44,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:44,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:01:44,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,747 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-09-20 13:01:44,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:44,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:44,781 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,798 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:43 [2019-09-20 13:01:44,846 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|]} [2019-09-20 13:01:44,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:01:44,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:44,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:44,928 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,949 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:94, output treesize:52 [2019-09-20 13:01:45,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:01:45,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,086 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-09-20 13:01:45,089 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:45,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 36 [2019-09-20 13:01:45,148 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,248 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 194 [2019-09-20 13:01:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,250 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,353 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-20 13:01:45,354 INFO L567 ElimStorePlain]: treesize reduction 96, result has 59.5 percent of original size [2019-09-20 13:01:45,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 67 [2019-09-20 13:01:45,358 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,386 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:227, output treesize:67 [2019-09-20 13:01:45,436 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-09-20 13:01:45,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2019-09-20 13:01:45,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,537 INFO L341 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-09-20 13:01:45,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 210 [2019-09-20 13:01:45,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,603 INFO L567 ElimStorePlain]: treesize reduction 48, result has 78.6 percent of original size [2019-09-20 13:01:45,746 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-20 13:01:45,746 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-09-20 13:01:45,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 187 [2019-09-20 13:01:45,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,751 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,803 INFO L567 ElimStorePlain]: treesize reduction 148, result has 45.0 percent of original size [2019-09-20 13:01:45,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:45,805 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:247, output treesize:121 [2019-09-20 13:01:45,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,939 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 6=[|#memory_$Pointer$.base|]} [2019-09-20 13:01:45,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 7 [2019-09-20 13:01:45,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 73 [2019-09-20 13:01:45,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:46,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:46,001 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:46,029 INFO L567 ElimStorePlain]: treesize reduction 44, result has 32.3 percent of original size [2019-09-20 13:01:46,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:46,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:13 [2019-09-20 13:01:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:46,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:46,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-20 13:01:46,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 13:01:46,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 13:01:46,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:01:46,079 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 18 states. [2019-09-20 13:01:47,158 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-20 13:01:47,317 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-20 13:01:47,734 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-09-20 13:01:48,036 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2019-09-20 13:01:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:48,671 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2019-09-20 13:01:48,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:01:48,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-09-20 13:01:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:48,673 INFO L225 Difference]: With dead ends: 200 [2019-09-20 13:01:48,674 INFO L226 Difference]: Without dead ends: 165 [2019-09-20 13:01:48,675 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2019-09-20 13:01:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-20 13:01:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2019-09-20 13:01:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:01:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2019-09-20 13:01:48,687 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 29 [2019-09-20 13:01:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:48,688 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2019-09-20 13:01:48,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 13:01:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2019-09-20 13:01:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:01:48,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:48,689 INFO L407 BasicCegarLoop]: trace histogram [3, 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] [2019-09-20 13:01:48,690 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:48,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2047911883, now seen corresponding path program 1 times [2019-09-20 13:01:48,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:48,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:48,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:01:48,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:48,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:48,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:48,756 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 5 states. [2019-09-20 13:01:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:48,851 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-09-20 13:01:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:48,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-09-20 13:01:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:48,853 INFO L225 Difference]: With dead ends: 148 [2019-09-20 13:01:48,854 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:01:48,855 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:01:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2019-09-20 13:01:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-20 13:01:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-09-20 13:01:48,874 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 29 [2019-09-20 13:01:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:48,875 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-09-20 13:01:48,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-09-20 13:01:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:01:48,879 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:48,879 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:48,879 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1863000761, now seen corresponding path program 1 times [2019-09-20 13:01:48,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:48,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:49,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:49,371 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:49,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-20 13:01:49,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:49,572 INFO L375 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 [2019-09-20 13:01:49,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:49,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:01:49,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,693 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-09-20 13:01:49,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:49,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:49,731 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,755 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-09-20 13:01:49,801 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]} [2019-09-20 13:01:49,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:01:49,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:49,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:49,890 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,915 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-09-20 13:01:50,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:01:50,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 2=[|v_#memory_int_45|], 9=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-09-20 13:01:50,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-09-20 13:01:50,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:50,153 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,235 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2019-09-20 13:01:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,241 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,411 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-09-20 13:01:50,412 INFO L567 ElimStorePlain]: treesize reduction 1201, result has 8.5 percent of original size [2019-09-20 13:01:50,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70 [2019-09-20 13:01:50,417 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,442 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-09-20 13:01:50,492 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|], 6=[|v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.base_41|]} [2019-09-20 13:01:50,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-09-20 13:01:50,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-09-20 13:01:50,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,708 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-20 13:01:50,709 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-09-20 13:01:50,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-09-20 13:01:50,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,716 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,793 INFO L567 ElimStorePlain]: treesize reduction 340, result has 23.3 percent of original size [2019-09-20 13:01:50,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,794 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-09-20 13:01:50,912 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-09-20 13:01:50,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-09-20 13:01:50,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2019-09-20 13:01:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,975 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:51,013 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-09-20 13:01:51,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:51,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-09-20 13:01:51,053 INFO L375 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 24 treesize of output 10 [2019-09-20 13:01:51,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-20 13:01:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:51,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-09-20 13:01:51,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 13:01:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 13:01:51,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:01:51,073 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 20 states. [2019-09-20 13:01:52,311 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-20 13:01:52,591 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-20 13:01:52,939 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-20 13:01:53,152 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-20 13:01:54,011 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-20 13:01:54,825 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-20 13:01:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:55,611 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2019-09-20 13:01:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-20 13:01:55,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-09-20 13:01:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:55,615 INFO L225 Difference]: With dead ends: 299 [2019-09-20 13:01:55,615 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:01:55,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=336, Invalid=2214, Unknown=0, NotChecked=0, Total=2550 [2019-09-20 13:01:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:01:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 121. [2019-09-20 13:01:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-20 13:01:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2019-09-20 13:01:55,630 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 29 [2019-09-20 13:01:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:55,630 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2019-09-20 13:01:55,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-20 13:01:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2019-09-20 13:01:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:01:55,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:55,632 INFO L407 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] [2019-09-20 13:01:55,633 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 921966592, now seen corresponding path program 1 times [2019-09-20 13:01:55,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:55,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:55,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:55,951 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:56,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:56,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-20 13:01:56,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:56,130 INFO L375 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 [2019-09-20 13:01:56,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-09-20 13:01:56,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-09-20 13:01:56,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,202 INFO L375 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 11 treesize of output 15 [2019-09-20 13:01:56,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,222 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:56,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-09-20 13:01:56,241 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,254 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:17 [2019-09-20 13:01:56,291 INFO L375 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 23 treesize of output 22 [2019-09-20 13:01:56,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,301 INFO L496 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. [2019-09-20 13:01:56,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-09-20 13:01:56,391 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|], 10=[|v_#memory_int_54|]} [2019-09-20 13:01:56,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:56,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-20 13:01:56,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:01:56,492 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-09-20 13:01:56,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:56,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-20 13:01:56,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-09-20 13:01:56,585 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2019-09-20 13:01:56,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:56,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:56,693 INFO L341 Elim1Store]: treesize reduction 33, result has 70.8 percent of original size [2019-09-20 13:01:56,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 95 [2019-09-20 13:01:56,694 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,788 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2019-09-20 13:01:56,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:85, output treesize:74 [2019-09-20 13:01:56,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,869 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|], 10=[|v_#memory_int_55|]} [2019-09-20 13:01:56,872 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,878 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,974 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.5 percent of original size [2019-09-20 13:01:56,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:57,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:57,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 121 [2019-09-20 13:01:57,056 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:57,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:57,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,101 INFO L375 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 2 case distinctions, treesize of input 51 treesize of output 61 [2019-09-20 13:01:57,102 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,229 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-20 13:01:57,230 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.0 percent of original size [2019-09-20 13:01:57,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:57,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-09-20 13:01:57,233 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:64 [2019-09-20 13:01:57,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,511 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-09-20 13:01:59,528 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-09-20 13:01:59,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,540 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-09-20 13:01:59,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-09-20 13:01:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-20 13:01:59,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 13:01:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 13:01:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:01:59,553 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand 18 states. [2019-09-20 13:02:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:00,788 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2019-09-20 13:02:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:02:00,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-09-20 13:02:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:00,791 INFO L225 Difference]: With dead ends: 228 [2019-09-20 13:02:00,791 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:02:00,792 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:02:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:02:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2019-09-20 13:02:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-20 13:02:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2019-09-20 13:02:00,806 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 31 [2019-09-20 13:02:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:00,806 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2019-09-20 13:02:00,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 13:02:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2019-09-20 13:02:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:02:00,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:00,808 INFO L407 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] [2019-09-20 13:02:00,808 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1731313218, now seen corresponding path program 1 times [2019-09-20 13:02:00,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:00,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:00,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:00,924 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:01,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-20 13:02:01,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:01,092 INFO L375 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 [2019-09-20 13:02:01,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:02:01,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:01,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,186 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-09-20 13:02:01,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:02:01,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-09-20 13:02:01,290 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-09-20 13:02:01,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 83 [2019-09-20 13:02:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:01,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:01,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-20 13:02:01,331 INFO L567 ElimStorePlain]: treesize reduction 98, result has 30.5 percent of original size [2019-09-20 13:02:01,331 INFO L496 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. [2019-09-20 13:02:01,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:42 [2019-09-20 13:02:01,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:02:01,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,445 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_43|], 6=[|v_#memory_$Pointer$.base_46|]} [2019-09-20 13:02:01,447 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:01,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2019-09-20 13:02:01,475 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,494 INFO L567 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-09-20 13:02:01,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,495 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:81, output treesize:4 [2019-09-20 13:02:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:01,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:01,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-09-20 13:02:01,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:01,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:01,506 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand 11 states. [2019-09-20 13:02:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,632 INFO L93 Difference]: Finished difference Result 305 states and 369 transitions. [2019-09-20 13:02:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:02,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-09-20 13:02:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,639 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:02:02,640 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:02:02,640 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:02:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:02:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 152. [2019-09-20 13:02:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:02:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2019-09-20 13:02:02,655 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 191 transitions. Word has length 31 [2019-09-20 13:02:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,655 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 191 transitions. [2019-09-20 13:02:02,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 191 transitions. [2019-09-20 13:02:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:02:02,656 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,656 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,657 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -840660915, now seen corresponding path program 1 times [2019-09-20 13:02:02,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:02,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:02,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 13:02:02,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:02,961 INFO L375 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 [2019-09-20 13:02:02,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:02:02,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,987 INFO L375 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 11 treesize of output 15 [2019-09-20 13:02:02,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:02:03,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:02:03,032 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,044 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-09-20 13:02:03,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,100 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-09-20 13:02:03,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:02:03,145 INFO L567 ElimStorePlain]: treesize reduction 142, result has 31.7 percent of original size [2019-09-20 13:02:03,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2019-09-20 13:02:03,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-09-20 13:02:03,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:03,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:03,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-09-20 13:02:03,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:03,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:03,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:03,256 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. Second operand 13 states. [2019-09-20 13:02:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,132 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2019-09-20 13:02:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:02:04,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-20 13:02:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,135 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:02:04,135 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:02:04,136 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:02:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2019-09-20 13:02:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:02:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2019-09-20 13:02:04,150 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 31 [2019-09-20 13:02:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,150 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2019-09-20 13:02:04,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2019-09-20 13:02:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:02:04,151 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,151 INFO L407 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] [2019-09-20 13:02:04,152 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1484298053, now seen corresponding path program 1 times [2019-09-20 13:02:04,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:02:04,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:04,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:04,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:04,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:04,200 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand 5 states. [2019-09-20 13:02:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,287 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2019-09-20 13:02:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:04,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 13:02:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,289 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:02:04,289 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:02:04,289 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:02:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-09-20 13:02:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-20 13:02:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2019-09-20 13:02:04,303 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 32 [2019-09-20 13:02:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,304 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2019-09-20 13:02:04,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2019-09-20 13:02:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:02:04,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,305 INFO L407 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] [2019-09-20 13:02:04,305 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1427039751, now seen corresponding path program 1 times [2019-09-20 13:02:04,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:02:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:02:04,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:02:04,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:02:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:04,380 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand 7 states. [2019-09-20 13:02:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,607 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-09-20 13:02:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:02:04,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-20 13:02:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,609 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:02:04,609 INFO L226 Difference]: Without dead ends: 184 [2019-09-20 13:02:04,609 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-20 13:02:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2019-09-20 13:02:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-20 13:02:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2019-09-20 13:02:04,632 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 32 [2019-09-20 13:02:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,632 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2019-09-20 13:02:04,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:02:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2019-09-20 13:02:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:02:04,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,633 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:04,634 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1652849204, now seen corresponding path program 2 times [2019-09-20 13:02:04,634 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:05,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:05,195 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:05,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:05,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:05,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:05,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-20 13:02:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:05,380 INFO L375 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 [2019-09-20 13:02:05,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:02:05,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:05,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,486 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-09-20 13:02:05,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:02:05,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:02:05,522 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,542 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-09-20 13:02:05,584 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 6=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_50|]} [2019-09-20 13:02:05,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:02:05,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:02:05,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:02:05,670 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,692 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-09-20 13:02:05,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-20 13:02:05,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,992 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-20 13:02:05,992 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-09-20 13:02:05,996 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_59|, |v_#memory_int_56|], 10=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_51|]} [2019-09-20 13:02:06,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:06,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-09-20 13:02:06,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-09-20 13:02:06,079 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 99 [2019-09-20 13:02:06,141 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,246 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 153 [2019-09-20 13:02:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,252 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,427 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-20 13:02:06,427 INFO L567 ElimStorePlain]: treesize reduction 334, result has 23.9 percent of original size [2019-09-20 13:02:06,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,428 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:236, output treesize:89 [2019-09-20 13:02:06,488 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|], 6=[|v_#memory_$Pointer$.offset_48|], 12=[|v_#memory_$Pointer$.base_52|]} [2019-09-20 13:02:06,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-09-20 13:02:06,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:06,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2019-09-20 13:02:06,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:06,692 INFO L341 Elim1Store]: treesize reduction 32, result has 64.4 percent of original size [2019-09-20 13:02:06,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 107 [2019-09-20 13:02:06,694 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,776 INFO L567 ElimStorePlain]: treesize reduction 66, result has 59.8 percent of original size [2019-09-20 13:02:06,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,777 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:98 [2019-09-20 13:02:06,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-09-20 13:02:06,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,016 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-20 13:02:07,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,020 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_int_61|], 10=[|v_#memory_$Pointer$.offset_49|], 18=[|v_#memory_$Pointer$.base_53|]} [2019-09-20 13:02:07,045 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:07,145 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-20 13:02:07,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 64 [2019-09-20 13:02:07,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 298 treesize of output 255 [2019-09-20 13:02:07,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,318 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,450 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-20 13:02:07,450 INFO L567 ElimStorePlain]: treesize reduction 116, result has 68.6 percent of original size [2019-09-20 13:02:07,644 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-20 13:02:07,645 INFO L341 Elim1Store]: treesize reduction 35, result has 82.5 percent of original size [2019-09-20 13:02:07,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 239 treesize of output 237 [2019-09-20 13:02:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,717 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:07,853 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-20 13:02:07,854 INFO L567 ElimStorePlain]: treesize reduction 163, result has 41.6 percent of original size [2019-09-20 13:02:07,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:07,855 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:376, output treesize:147 [2019-09-20 13:02:07,950 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_62|, |v_#memory_$Pointer$.offset_50|], 20=[|v_#memory_$Pointer$.base_54|]} [2019-09-20 13:02:07,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2019-09-20 13:02:07,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,087 INFO L341 Elim1Store]: treesize reduction 50, result has 55.0 percent of original size [2019-09-20 13:02:08,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 319 [2019-09-20 13:02:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:08,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-09-20 13:02:08,270 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-20 13:02:08,270 INFO L567 ElimStorePlain]: treesize reduction 614, result has 32.9 percent of original size [2019-09-20 13:02:08,511 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-20 13:02:08,511 INFO L341 Elim1Store]: treesize reduction 66, result has 74.3 percent of original size [2019-09-20 13:02:08,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 280 [2019-09-20 13:02:08,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:08,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:08,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:08,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,528 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,776 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-20 13:02:08,777 INFO L567 ElimStorePlain]: treesize reduction 3569, result has 6.2 percent of original size [2019-09-20 13:02:08,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,780 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:387, output treesize:233 [2019-09-20 13:02:08,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:08,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:08,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:08,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 180 [2019-09-20 13:02:08,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:08,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:08,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 1 [2019-09-20 13:02:08,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,980 INFO L496 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. [2019-09-20 13:02:08,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:505, output treesize:171 [2019-09-20 13:02:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:09,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-09-20 13:02:09,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=354, Unknown=1, NotChecked=0, Total=420 [2019-09-20 13:02:09,059 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 21 states. [2019-09-20 13:02:10,593 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-20 13:02:11,223 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-09-20 13:02:11,904 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2019-09-20 13:02:12,167 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-20 13:02:12,479 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-09-20 13:02:12,676 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-20 13:02:13,045 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-09-20 13:02:13,377 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-09-20 13:02:13,546 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-20 13:02:14,044 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-09-20 13:02:14,240 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-20 13:02:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:14,885 INFO L93 Difference]: Finished difference Result 350 states and 421 transitions. [2019-09-20 13:02:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-20 13:02:14,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-09-20 13:02:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:14,888 INFO L225 Difference]: With dead ends: 350 [2019-09-20 13:02:14,888 INFO L226 Difference]: Without dead ends: 302 [2019-09-20 13:02:14,890 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=434, Invalid=2217, Unknown=1, NotChecked=0, Total=2652 [2019-09-20 13:02:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-20 13:02:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 187. [2019-09-20 13:02:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-20 13:02:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2019-09-20 13:02:14,908 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 33 [2019-09-20 13:02:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:14,909 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2019-09-20 13:02:14,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2019-09-20 13:02:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:02:14,910 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:14,910 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:14,910 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1263003227, now seen corresponding path program 1 times [2019-09-20 13:02:14,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:14,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:15,202 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38