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-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:11,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:11,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:11,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:11,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:11,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:11,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:11,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:11,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:11,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:11,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:11,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:11,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:11,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:11,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:11,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:11,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:11,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:11,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:11,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:11,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:11,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:11,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:11,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:11,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:11,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:11,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:11,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:11,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:11,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:11,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:11,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:11,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:11,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:11,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:11,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:11,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:11,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:11,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:11,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:11,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:11,264 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-10-14 22:07:11,280 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:11,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:11,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:11,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:11,283 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:11,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:11,284 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:11,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:11,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:11,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:11,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:11,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:11,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:11,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:11,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:11,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:11,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:11,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:11,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:11,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:11,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:11,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:11,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:11,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:11,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:11,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:11,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:11,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:11,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:11,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:11,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:11,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:11,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:11,607 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:11,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-14 22:07:11,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba9f9e7b/d5f16b9faec94226b702a0c9609c9f35/FLAGba42ad5ce [2019-10-14 22:07:12,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:12,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-14 22:07:12,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba9f9e7b/d5f16b9faec94226b702a0c9609c9f35/FLAGba42ad5ce [2019-10-14 22:07:12,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba9f9e7b/d5f16b9faec94226b702a0c9609c9f35 [2019-10-14 22:07:12,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:12,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:12,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:12,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:12,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:12,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:12" (1/1) ... [2019-10-14 22:07:12,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358a6207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:12, skipping insertion in model container [2019-10-14 22:07:12,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:12" (1/1) ... [2019-10-14 22:07:12,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:12,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:13,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:13,043 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:13,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:13,167 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:13,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13 WrapperNode [2019-10-14 22:07:13,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:13,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:13,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:13,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:13,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (1/1) ... [2019-10-14 22:07:13,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:13,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:13,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:13,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:13,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (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-10-14 22:07:13,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:13,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:13,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:13,944 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:13,944 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 22:07:13,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:13 BoogieIcfgContainer [2019-10-14 22:07:13,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:13,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:13,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:13,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:13,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:12" (1/3) ... [2019-10-14 22:07:13,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0c6beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:13, skipping insertion in model container [2019-10-14 22:07:13,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:13" (2/3) ... [2019-10-14 22:07:13,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0c6beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:13, skipping insertion in model container [2019-10-14 22:07:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:13" (3/3) ... [2019-10-14 22:07:13,956 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2019-10-14 22:07:13,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:13,975 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:07:13,986 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:07:14,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:14,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:14,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:14,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:14,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:14,013 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:14,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:14,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-14 22:07:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:07:14,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:14,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:14,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash 905993573, now seen corresponding path program 1 times [2019-10-14 22:07:14,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:14,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507709398] [2019-10-14 22:07:14,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:14,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507709398] [2019-10-14 22:07:14,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:14,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:14,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117056456] [2019-10-14 22:07:14,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:14,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:14,319 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-14 22:07:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:14,464 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-10-14 22:07:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:14,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 22:07:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:14,478 INFO L225 Difference]: With dead ends: 57 [2019-10-14 22:07:14,479 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 22:07:14,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-14 22:07:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 22:07:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-14 22:07:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 22:07:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-14 22:07:14,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2019-10-14 22:07:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:14,551 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-14 22:07:14,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-14 22:07:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:14,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:14,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:14,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash 550815853, now seen corresponding path program 1 times [2019-10-14 22:07:14,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:14,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072138447] [2019-10-14 22:07:14,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:14,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072138447] [2019-10-14 22:07:14,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:14,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:07:14,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153105509] [2019-10-14 22:07:14,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:07:14,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:07:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:14,659 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-10-14 22:07:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:14,743 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-14 22:07:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:07:14,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-14 22:07:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:14,745 INFO L225 Difference]: With dead ends: 29 [2019-10-14 22:07:14,745 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 22:07:14,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 22:07:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-14 22:07:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 22:07:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-14 22:07:14,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-10-14 22:07:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:14,753 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-14 22:07:14,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:07:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-14 22:07:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:14,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:14,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:14,754 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 550817775, now seen corresponding path program 1 times [2019-10-14 22:07:14,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:14,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935881652] [2019-10-14 22:07:14,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:14,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:14,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935881652] [2019-10-14 22:07:14,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:14,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:14,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083277341] [2019-10-14 22:07:14,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:14,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:14,953 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-10-14 22:07:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:15,188 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-10-14 22:07:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:15,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 22:07:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:15,190 INFO L225 Difference]: With dead ends: 44 [2019-10-14 22:07:15,190 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 22:07:15,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 22:07:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-10-14 22:07:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 22:07:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-14 22:07:15,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2019-10-14 22:07:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:15,197 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-14 22:07:15,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-14 22:07:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:15,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:15,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:15,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash 548970733, now seen corresponding path program 1 times [2019-10-14 22:07:15,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:15,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60016981] [2019-10-14 22:07:15,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:15,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:15,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:15,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60016981] [2019-10-14 22:07:15,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:15,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:07:15,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719425128] [2019-10-14 22:07:15,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:15,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:15,497 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 8 states. [2019-10-14 22:07:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:15,992 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-10-14 22:07:15,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:15,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-14 22:07:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:15,994 INFO L225 Difference]: With dead ends: 90 [2019-10-14 22:07:15,994 INFO L226 Difference]: Without dead ends: 73 [2019-10-14 22:07:15,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:07:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-14 22:07:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-10-14 22:07:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:07:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2019-10-14 22:07:16,018 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 20 [2019-10-14 22:07:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:16,018 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2019-10-14 22:07:16,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2019-10-14 22:07:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:16,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:16,020 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:16,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1969142159, now seen corresponding path program 1 times [2019-10-14 22:07:16,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:16,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374361055] [2019-10-14 22:07:16,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:16,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374361055] [2019-10-14 22:07:16,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:16,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:16,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947034991] [2019-10-14 22:07:16,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:16,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:16,137 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 7 states. [2019-10-14 22:07:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:16,379 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-14 22:07:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:16,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 22:07:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:16,380 INFO L225 Difference]: With dead ends: 85 [2019-10-14 22:07:16,380 INFO L226 Difference]: Without dead ends: 64 [2019-10-14 22:07:16,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-14 22:07:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2019-10-14 22:07:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 22:07:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-14 22:07:16,389 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2019-10-14 22:07:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:16,389 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-14 22:07:16,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-14 22:07:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:16,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:16,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:16,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944649, now seen corresponding path program 1 times [2019-10-14 22:07:16,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:16,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344401965] [2019-10-14 22:07:16,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:16,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344401965] [2019-10-14 22:07:16,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:16,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:16,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204521002] [2019-10-14 22:07:16,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:16,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:16,468 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-10-14 22:07:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:16,739 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2019-10-14 22:07:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:16,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-14 22:07:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:16,741 INFO L225 Difference]: With dead ends: 84 [2019-10-14 22:07:16,741 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 22:07:16,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 22:07:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-10-14 22:07:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 22:07:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-10-14 22:07:16,750 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 21 [2019-10-14 22:07:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:16,751 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-10-14 22:07:16,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-10-14 22:07:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:16,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:16,752 INFO L380 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] [2019-10-14 22:07:16,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 61652601, now seen corresponding path program 1 times [2019-10-14 22:07:16,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:16,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82418584] [2019-10-14 22:07:16,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:17,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82418584] [2019-10-14 22:07:17,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307023019] [2019-10-14 22:07:17,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 22:07:17,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:17,488 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-10-14 22:07:17,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:17,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,538 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-10-14 22:07:17,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,603 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-10-14 22:07:17,622 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 31 treesize of output 17 [2019-10-14 22:07:17,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,648 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 31 treesize of output 17 [2019-10-14 22:07:17,648 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,689 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-10-14 22:07:17,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,844 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 28 treesize of output 99 [2019-10-14 22:07:17,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,966 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-14 22:07:17,967 INFO L567 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-10-14 22:07:17,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,027 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 2 case distinctions, treesize of input 85 treesize of output 111 [2019-10-14 22:07:18,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,130 INFO L567 ElimStorePlain]: treesize reduction 96, result has 57.1 percent of original size [2019-10-14 22:07:18,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2019-10-14 22:07:18,143 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:18,181 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2019-10-14 22:07:18,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,331 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 31 treesize of output 47 [2019-10-14 22:07:18,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,438 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-14 22:07:18,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,444 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.offset_43|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-10-14 22:07:18,461 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:18,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,557 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:18,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2019-10-14 22:07:18,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:19,303 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-14 22:07:19,303 INFO L341 Elim1Store]: treesize reduction 170, result has 67.1 percent of original size [2019-10-14 22:07:19,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 182 treesize of output 418 [2019-10-14 22:07:19,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:19,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:19,503 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:21,257 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 288 DAG size of output: 67 [2019-10-14 22:07:21,258 INFO L567 ElimStorePlain]: treesize reduction 240062, result has 0.1 percent of original size [2019-10-14 22:07:21,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:21,260 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:285, output treesize:215 [2019-10-14 22:07:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:21,672 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:21,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-10-14 22:07:21,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531373545] [2019-10-14 22:07:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 22:07:21,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 22:07:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:07:21,679 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 20 states. [2019-10-14 22:07:26,465 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-14 22:07:34,914 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2019-10-14 22:07:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:37,614 INFO L93 Difference]: Finished difference Result 232 states and 302 transitions. [2019-10-14 22:07:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-14 22:07:37,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-10-14 22:07:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:37,618 INFO L225 Difference]: With dead ends: 232 [2019-10-14 22:07:37,618 INFO L226 Difference]: Without dead ends: 215 [2019-10-14 22:07:37,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1209, Invalid=4168, Unknown=25, NotChecked=0, Total=5402 [2019-10-14 22:07:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-14 22:07:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 65. [2019-10-14 22:07:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 22:07:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2019-10-14 22:07:37,635 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 23 [2019-10-14 22:07:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:37,635 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2019-10-14 22:07:37,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 22:07:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2019-10-14 22:07:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:37,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:37,637 INFO L380 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] [2019-10-14 22:07:37,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:37,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1838507005, now seen corresponding path program 1 times [2019-10-14 22:07:37,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:37,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331233638] [2019-10-14 22:07:37,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:38,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331233638] [2019-10-14 22:07:38,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515363776] [2019-10-14 22:07:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 22:07:38,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:38,196 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-10-14 22:07:38,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:38,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,269 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-10-14 22:07:38,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,329 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-14 22:07:38,330 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_int_33|]} [2019-10-14 22:07:38,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:38,343 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 24 treesize of output 9 [2019-10-14 22:07:38,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,365 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-10-14 22:07:38,366 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:38,377 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:27 [2019-10-14 22:07:38,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,455 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-10-14 22:07:38,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:38,489 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 25 treesize of output 13 [2019-10-14 22:07:38,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,510 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 25 treesize of output 13 [2019-10-14 22:07:38,510 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,524 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:17 [2019-10-14 22:07:38,549 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|], 4=[|v_#memory_int_38|]} [2019-10-14 22:07:38,551 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:38,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:38,628 INFO L341 Elim1Store]: treesize reduction 82, result has 32.2 percent of original size [2019-10-14 22:07:38,629 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 2 case distinctions, treesize of input 55 treesize of output 51 [2019-10-14 22:07:38,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:13 [2019-10-14 22:07:38,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:38,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:38,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-10-14 22:07:38,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309616582] [2019-10-14 22:07:38,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:38,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:38,732 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 15 states. [2019-10-14 22:07:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:39,278 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2019-10-14 22:07:39,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:07:39,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-10-14 22:07:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:39,280 INFO L225 Difference]: With dead ends: 112 [2019-10-14 22:07:39,280 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 22:07:39,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 22:07:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2019-10-14 22:07:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 22:07:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-10-14 22:07:39,291 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 23 [2019-10-14 22:07:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:39,292 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-10-14 22:07:39,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-10-14 22:07:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:39,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:39,293 INFO L380 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] [2019-10-14 22:07:39,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:39,498 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1799525935, now seen corresponding path program 1 times [2019-10-14 22:07:39,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:39,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68747486] [2019-10-14 22:07:39,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:39,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:39,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:39,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68747486] [2019-10-14 22:07:39,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424184431] [2019-10-14 22:07:39,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:39,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 22:07:39,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:39,889 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-10-14 22:07:39,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:39,900 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-10-14 22:07:39,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,912 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-10-14 22:07:39,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-14 22:07:39,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,979 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-10-14 22:07:39,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,063 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-10-14 22:07:40,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,074 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 37 treesize of output 27 [2019-10-14 22:07:40,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,104 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 37 treesize of output 27 [2019-10-14 22:07:40,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,130 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:57 [2019-10-14 22:07:40,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,196 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-10-14 22:07:40,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,288 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_$Pointer$.offset_47|], 12=[|v_#memory_$Pointer$.base_47|]} [2019-10-14 22:07:40,292 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:40,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,360 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:40,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,429 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 78 treesize of output 60 [2019-10-14 22:07:40,429 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:40,818 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-10-14 22:07:40,818 INFO L341 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2019-10-14 22:07:40,819 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 7 case distinctions, treesize of input 131 treesize of output 323 [2019-10-14 22:07:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:40,823 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,933 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-10-14 22:07:40,934 INFO L567 ElimStorePlain]: treesize reduction 273, result has 32.8 percent of original size [2019-10-14 22:07:40,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:40,936 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:230, output treesize:151 [2019-10-14 22:07:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:41,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-10-14 22:07:41,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454152305] [2019-10-14 22:07:41,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:41,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=167, Unknown=1, NotChecked=0, Total=210 [2019-10-14 22:07:41,061 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 15 states. [2019-10-14 22:07:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:55,168 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2019-10-14 22:07:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 22:07:55,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-10-14 22:07:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:55,170 INFO L225 Difference]: With dead ends: 201 [2019-10-14 22:07:55,170 INFO L226 Difference]: Without dead ends: 182 [2019-10-14 22:07:55,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1161, Unknown=5, NotChecked=0, Total=1482 [2019-10-14 22:07:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-14 22:07:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 66. [2019-10-14 22:07:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 22:07:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-10-14 22:07:55,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 24 [2019-10-14 22:07:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:55,191 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-10-14 22:07:55,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-10-14 22:07:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:55,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:55,194 INFO L380 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] [2019-10-14 22:07:55,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:55,400 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -718586957, now seen corresponding path program 1 times [2019-10-14 22:07:55,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:55,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624066037] [2019-10-14 22:07:55,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:55,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624066037] [2019-10-14 22:07:55,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443151460] [2019-10-14 22:07:55,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 22:07:55,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:55,721 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-10-14 22:07:55,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:55,737 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-10-14 22:07:55,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,755 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-10-14 22:07:55,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-14 22:07:55,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,832 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-10-14 22:07:55,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,893 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-10-14 22:07:55,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,903 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 37 treesize of output 27 [2019-10-14 22:07:55,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,932 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 37 treesize of output 27 [2019-10-14 22:07:55,933 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,959 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:57 [2019-10-14 22:07:56,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,041 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-10-14 22:07:56,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,133 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.offset_51|], 12=[|v_#memory_$Pointer$.base_51|]} [2019-10-14 22:07:56,136 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:56,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,196 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:56,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,263 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 78 treesize of output 60 [2019-10-14 22:07:56,263 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,647 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-10-14 22:07:56,648 INFO L341 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2019-10-14 22:07:56,648 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 7 case distinctions, treesize of input 131 treesize of output 323 [2019-10-14 22:07:56,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:56,669 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,024 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-10-14 22:07:57,025 INFO L567 ElimStorePlain]: treesize reduction 8121, result has 1.6 percent of original size [2019-10-14 22:07:57,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:57,027 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:227, output treesize:138 [2019-10-14 22:07:57,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,129 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:57,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 22:07:57,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19385116] [2019-10-14 22:07:57,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:07:57,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:07:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2019-10-14 22:07:57,130 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 14 states.