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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:27,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:27,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:27,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:27,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:27,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:27,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:27,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:27,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:27,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:27,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:27,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:27,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:27,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:27,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:27,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:27,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:27,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:27,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:27,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:27,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:27,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:27,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:27,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:27,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:27,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:27,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:27,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:27,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:27,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:27,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:27,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:27,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:27,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:27,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:27,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:27,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:27,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:27,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:27,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:27,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:27,320 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-13 20:12:27,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:27,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:27,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:27,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:27,337 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:27,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:27,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:27,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:27,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:27,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:27,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:27,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:27,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:27,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:27,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:27,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:27,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:27,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:27,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:27,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:27,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:27,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:27,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:27,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:27,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:27,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:27,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:27,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:27,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:27,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:27,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:27,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:27,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:27,651 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:27,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2019-10-13 20:12:27,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3a99196/e0d49b8229ab4d3d95e14ea96608b23e/FLAGab1d55dfa [2019-10-13 20:12:28,337 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:28,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2019-10-13 20:12:28,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3a99196/e0d49b8229ab4d3d95e14ea96608b23e/FLAGab1d55dfa [2019-10-13 20:12:28,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3a99196/e0d49b8229ab4d3d95e14ea96608b23e [2019-10-13 20:12:28,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:28,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:28,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:28,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:28,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:28,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:28" (1/1) ... [2019-10-13 20:12:28,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8abc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:28, skipping insertion in model container [2019-10-13 20:12:28,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:28" (1/1) ... [2019-10-13 20:12:28,610 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:28,658 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:29,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:29,158 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:29,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:29,276 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:29,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29 WrapperNode [2019-10-13 20:12:29,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:29,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:29,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:29,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:29,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (1/1) ... [2019-10-13 20:12:29,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:29,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:29,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:29,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:29,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (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-13 20:12:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 20:12:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 20:12:29,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 20:12:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:29,983 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:29,983 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 20:12:29,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:29 BoogieIcfgContainer [2019-10-13 20:12:29,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:29,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:29,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:29,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:29,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:28" (1/3) ... [2019-10-13 20:12:29,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758d213d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:29, skipping insertion in model container [2019-10-13 20:12:29,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:29" (2/3) ... [2019-10-13 20:12:29,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758d213d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:29, skipping insertion in model container [2019-10-13 20:12:29,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:29" (3/3) ... [2019-10-13 20:12:29,994 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2019-10-13 20:12:30,004 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:30,012 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:12:30,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:12:30,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:30,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:30,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:30,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:30,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:30,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:30,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:30,047 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 20:12:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 20:12:30,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:30,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:30,070 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -53964180, now seen corresponding path program 1 times [2019-10-13 20:12:30,085 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:30,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880322013] [2019-10-13 20:12:30,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:30,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:30,272 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-13 20:12:30,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880322013] [2019-10-13 20:12:30,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:30,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:30,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78311851] [2019-10-13 20:12:30,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:30,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:30,295 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-13 20:12:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:30,314 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-13 20:12:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:30,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-13 20:12:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:30,327 INFO L225 Difference]: With dead ends: 33 [2019-10-13 20:12:30,327 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 20:12:30,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 20:12:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 20:12:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 20:12:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-13 20:12:30,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2019-10-13 20:12:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:30,372 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-13 20:12:30,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-10-13 20:12:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 20:12:30,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:30,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:30,374 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1423019225, now seen corresponding path program 1 times [2019-10-13 20:12:30,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:30,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329086871] [2019-10-13 20:12:30,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:30,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:30,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:30,787 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-13 20:12:30,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329086871] [2019-10-13 20:12:30,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:30,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 20:12:30,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885285686] [2019-10-13 20:12:30,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 20:12:30,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 20:12:30,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:30,792 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-10-13 20:12:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:31,142 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-13 20:12:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:31,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-13 20:12:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:31,147 INFO L225 Difference]: With dead ends: 33 [2019-10-13 20:12:31,148 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 20:12:31,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:12:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 20:12:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-13 20:12:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 20:12:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-13 20:12:31,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-10-13 20:12:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:31,166 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-13 20:12:31,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 20:12:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-13 20:12:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 20:12:31,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:31,168 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:31,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1423021147, now seen corresponding path program 1 times [2019-10-13 20:12:31,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:31,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701033595] [2019-10-13 20:12:31,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:31,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:31,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:31,499 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-13 20:12:31,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701033595] [2019-10-13 20:12:31,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:31,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:31,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970110069] [2019-10-13 20:12:31,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:31,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:31,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:31,505 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2019-10-13 20:12:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:31,783 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-10-13 20:12:31,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:31,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-13 20:12:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:31,785 INFO L225 Difference]: With dead ends: 35 [2019-10-13 20:12:31,785 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 20:12:31,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:12:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 20:12:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-10-13 20:12:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 20:12:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-13 20:12:31,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2019-10-13 20:12:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:31,798 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-13 20:12:31,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-10-13 20:12:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 20:12:31,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:31,800 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:31,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash -442037965, now seen corresponding path program 1 times [2019-10-13 20:12:31,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:31,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182249655] [2019-10-13 20:12:31,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:31,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:31,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:32,243 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-13 20:12:32,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182249655] [2019-10-13 20:12:32,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207670267] [2019-10-13 20:12:32,244 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-13 20:12:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-13 20:12:32,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:32,525 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 20:12:32,525 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 20:12:32,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:32,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:32,590 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_26|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_23|]} [2019-10-13 20:12:32,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:32,679 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-13 20:12:32,680 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 1 case distinctions, treesize of input 38 treesize of output 48 [2019-10-13 20:12:32,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:32,793 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-13 20:12:32,794 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.9 percent of original size [2019-10-13 20:12:32,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:32,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 20:12:32,807 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:32,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:32,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:32,866 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 18 treesize of output 19 [2019-10-13 20:12:32,867 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:32,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:32,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:32,964 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-10-13 20:12:32,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 60 [2019-10-13 20:12:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:32,971 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,065 INFO L567 ElimStorePlain]: treesize reduction 55, result has 63.8 percent of original size [2019-10-13 20:12:33,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:33,068 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:112, output treesize:96 [2019-10-13 20:12:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:33,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 243 [2019-10-13 20:12:33,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-10-13 20:12:33,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-10-13 20:12:33,367 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 244 [2019-10-13 20:12:33,406 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:34,670 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 98 [2019-10-13 20:12:34,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:34,675 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.offset_23|], 10=[|v_#memory_int_27|]} [2019-10-13 20:12:34,692 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,720 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,733 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,745 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:36,655 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 116 [2019-10-13 20:12:36,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:36,669 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:36,700 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:36,714 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:36,726 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:38,240 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 118 [2019-10-13 20:12:38,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:38,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:38,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 220 [2019-10-13 20:12:38,357 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:38,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-10-13 20:12:38,463 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:38,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-10-13 20:12:38,549 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:38,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2019-10-13 20:12:38,604 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:39,905 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 112 [2019-10-13 20:12:39,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:39,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:39,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 194 [2019-10-13 20:12:40,105 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:40,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-10-13 20:12:40,307 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:40,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,470 INFO L235 Elim1Store]: Index analysis took 138 ms [2019-10-13 20:12:40,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 195 [2019-10-13 20:12:40,603 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:40,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:40,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-10-13 20:12:40,686 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:41,591 WARN L191 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-13 20:12:41,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:41,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:41,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-10-13 20:12:41,645 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:41,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:41,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-10-13 20:12:41,709 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:41,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:41,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 179 [2019-10-13 20:12:41,778 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:41,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:41,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 180 [2019-10-13 20:12:41,843 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:42,775 WARN L191 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-13 20:12:42,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:42,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:42,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:42,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:42,916 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 175 treesize of output 156 [2019-10-13 20:12:42,918 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:42,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:42,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 155 [2019-10-13 20:12:43,130 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:43,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,234 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 175 treesize of output 156 [2019-10-13 20:12:43,235 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:43,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 154 [2019-10-13 20:12:43,288 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:43,728 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-13 20:12:43,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:43,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-10-13 20:12:43,799 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:43,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:43,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,017 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-13 20:12:44,018 INFO L341 Elim1Store]: treesize reduction 51, result has 72.4 percent of original size [2019-10-13 20:12:44,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 251 [2019-10-13 20:12:44,021 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:44,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-10-13 20:12:44,050 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:44,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:44,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 121 [2019-10-13 20:12:44,076 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:44,514 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-10-13 20:12:44,515 INFO L567 ElimStorePlain]: treesize reduction 95, result has 84.4 percent of original size [2019-10-13 20:12:44,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-10-13 20:12:44,524 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:962, output treesize:593 [2019-10-13 20:12:44,863 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-13 20:12:45,046 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-13 20:12:45,238 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-13 20:12:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 20:12:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 20:12:45,279 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|, v_prenex_3], 10=[v_prenex_1, v_prenex_2], 12=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 39=[v_prenex_6], 46=[v_prenex_4, v_prenex_5]} [2019-10-13 20:12:45,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:45,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 146 [2019-10-13 20:12:45,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:46,047 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 162 [2019-10-13 20:12:46,047 INFO L567 ElimStorePlain]: treesize reduction 30, result has 97.3 percent of original size [2019-10-13 20:12:46,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 20:12:46,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 114 [2019-10-13 20:12:46,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:46,390 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-10-13 20:12:46,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:46,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:46,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:46,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 136 [2019-10-13 20:12:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:46,470 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-13 20:12:47,074 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2019-10-13 20:12:47,075 INFO L567 ElimStorePlain]: treesize reduction 36, result has 96.6 percent of original size [2019-10-13 20:12:47,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:47,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2019-10-13 20:12:47,097 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:47,383 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-13 20:12:47,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:47,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:47,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:47,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:47,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 171 [2019-10-13 20:12:47,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:47,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:47,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:47,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:47,447 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:48,129 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2019-10-13 20:12:48,129 INFO L567 ElimStorePlain]: treesize reduction 44, result has 95.3 percent of original size [2019-10-13 20:12:48,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:48,146 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:48,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 61 [2019-10-13 20:12:48,157 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:48,436 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-13 20:12:48,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:48,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:48,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 137 [2019-10-13 20:12:48,457 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:48,502 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 20:12:48,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:48,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 183 [2019-10-13 20:12:48,537 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:48,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:48,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 137 [2019-10-13 20:12:48,555 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:48,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:48,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 135 [2019-10-13 20:12:48,580 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:48,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:48,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 124 [2019-10-13 20:12:48,594 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,244 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-10-13 20:12:49,245 INFO L567 ElimStorePlain]: treesize reduction 86, result has 89.1 percent of original size [2019-10-13 20:12:49,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-10-13 20:12:49,318 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 156 [2019-10-13 20:12:49,398 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 150 [2019-10-13 20:12:49,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,485 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:49,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-10-13 20:12:49,565 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 149 [2019-10-13 20:12:49,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:49,625 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:49,882 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-10-13 20:12:49,882 INFO L567 ElimStorePlain]: treesize reduction 198, result has 66.3 percent of original size [2019-10-13 20:12:49,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-10-13 20:12:49,900 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2019-10-13 20:12:49,919 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2019-10-13 20:12:49,938 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:49,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2019-10-13 20:12:49,955 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:49,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:49,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 57 [2019-10-13 20:12:49,970 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:50,073 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-13 20:12:50,073 INFO L567 ElimStorePlain]: treesize reduction 35, result has 78.3 percent of original size [2019-10-13 20:12:50,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-10-13 20:12:50,075 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:1165, output treesize:110 [2019-10-13 20:12:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 20:12:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,191 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-13 20:12:50,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:50,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:50,307 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 5=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_23|], 13=[|v_#memory_int_30|]} [2019-10-13 20:12:50,321 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-13 20:12:50,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:50,383 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-13 20:12:50,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:50,442 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-13 20:12:50,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:50,490 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:50,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:50,527 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:50,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:50,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:50,552 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:456, output treesize:633 [2019-10-13 20:12:50,717 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-13 20:12:50,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [268141980] [2019-10-13 20:12:50,724 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-10-13 20:12:50,764 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:50,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:50,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:50,837 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 45 variables. [2019-10-13 20:12:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:50,841 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:50,887 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:50,888 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:50,891 INFO L553 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-10-13 20:12:50,891 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:50,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:50,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9, 8, 8] total 18 [2019-10-13 20:12:50,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216667592] [2019-10-13 20:12:50,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:50,902 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:50,902 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:50,903 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 2 states. [2019-10-13 20:12:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:50,905 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-10-13 20:12:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:50,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-13 20:12:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:50,906 INFO L225 Difference]: With dead ends: 26 [2019-10-13 20:12:50,906 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:50,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:50,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-10-13 20:12:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:50,909 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:50,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:50,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:51,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:51,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:51,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:51,136 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:51,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:51,137 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 565 593) no Hoare annotation was computed. [2019-10-13 20:12:51,137 INFO L443 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 588) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L585-2(lines 585 588) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 565 593) the Hoare annotation is: true [2019-10-13 20:12:51,138 INFO L439 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: false [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 591) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L590-2(lines 590 591) no Hoare annotation was computed. [2019-10-13 20:12:51,138 INFO L439 ceAbstractionStarter]: At program point L590-4(lines 584 592) the Hoare annotation is: false [2019-10-13 20:12:51,138 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 565 593) no Hoare annotation was computed. [2019-10-13 20:12:51,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:51 BoogieIcfgContainer [2019-10-13 20:12:51,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:51,149 INFO L168 Benchmark]: Toolchain (without parser) took 22556.23 ms. Allocated memory was 135.8 MB in the beginning and 355.5 MB in the end (delta: 219.7 MB). Free memory was 99.1 MB in the beginning and 145.5 MB in the end (delta: -46.4 MB). Peak memory consumption was 173.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:51,149 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 20:12:51,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.27 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 165.1 MB in the end (delta: -66.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:51,150 INFO L168 Benchmark]: Boogie Preprocessor took 72.05 ms. Allocated memory is still 199.2 MB. Free memory was 165.1 MB in the beginning and 163.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:51,151 INFO L168 Benchmark]: RCFGBuilder took 628.65 ms. Allocated memory is still 199.2 MB. Free memory was 162.1 MB in the beginning and 119.0 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:51,151 INFO L168 Benchmark]: TraceAbstraction took 21161.05 ms. Allocated memory was 199.2 MB in the beginning and 355.5 MB in the end (delta: 156.2 MB). Free memory was 119.0 MB in the beginning and 145.5 MB in the end (delta: -26.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:51,153 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 683.27 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 165.1 MB in the end (delta: -66.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.05 ms. Allocated memory is still 199.2 MB. Free memory was 165.1 MB in the beginning and 163.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 628.65 ms. Allocated memory is still 199.2 MB. Free memory was 162.1 MB in the beginning and 119.0 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21161.05 ms. Allocated memory was 199.2 MB in the beginning and 355.5 MB in the end (delta: 156.2 MB). Free memory was 119.0 MB in the beginning and 145.5 MB in the end (delta: -26.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 591]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 21.0s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 28 SDslu, 122 SDs, 0 SdLazy, 97 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 6 NumberOfFragments, 6 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 5 QuantifiedInterpolants, 104541 SizeOfPredicates, 22 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 118, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.8529411764705882, AVG_VARS_REMOVED_DURING_WEAKENING: 2.0588235294117645, AVG_WEAKENED_CONJUNCTS: 0.35294117647058826, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...