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-13a467a-m [2019-10-15 00:11:28,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:11:28,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:11:28,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:11:28,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:11:28,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:11:28,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:11:28,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:11:28,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:11:28,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:11:28,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:11:28,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:11:28,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:11:28,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:11:28,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:11:28,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:11:28,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:11:28,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:11:28,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:11:28,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:11:28,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:11:28,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:11:28,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:11:28,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:11:28,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:11:28,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:11:28,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:11:28,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:11:28,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:11:28,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:11:28,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:11:28,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:11:28,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:11:28,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:11:28,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:11:28,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:11:28,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:11:28,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:11:28,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:11:28,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:11:28,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:11:28,249 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-15 00:11:28,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:11:28,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:11:28,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:11:28,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:11:28,293 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:11:28,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:11:28,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:11:28,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:11:28,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:11:28,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:11:28,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:11:28,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:11:28,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:11:28,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:11:28,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:11:28,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:11:28,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:11:28,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:11:28,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:11:28,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:11:28,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:11:28,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:11:28,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:11:28,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:11:28,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:11:28,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:11:28,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:11:28,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:11:28,301 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-15 00:11:28,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:11:28,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:11:28,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:11:28,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:11:28,649 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:11:28,650 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-15 00:11:28,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad6317e7/374310d1a704495e876a24393bb29999/FLAG8c1ae06cf [2019-10-15 00:11:29,257 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:11:29,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2019-10-15 00:11:29,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad6317e7/374310d1a704495e876a24393bb29999/FLAG8c1ae06cf [2019-10-15 00:11:29,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad6317e7/374310d1a704495e876a24393bb29999 [2019-10-15 00:11:29,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:29,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:29,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:29,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:29,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:29,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:29" (1/1) ... [2019-10-15 00:11:29,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b8ee53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:29, skipping insertion in model container [2019-10-15 00:11:29,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:29" (1/1) ... [2019-10-15 00:11:29,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:29,695 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:30,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:30,228 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:30,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:30,337 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:30,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30 WrapperNode [2019-10-15 00:11:30,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:30,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:30,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:30,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:30,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (1/1) ... [2019-10-15 00:11:30,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:30,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:30,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:30,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:30,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (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-15 00:11:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-15 00:11:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-15 00:11:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:31,025 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:31,025 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 00:11:31,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:31 BoogieIcfgContainer [2019-10-15 00:11:31,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:31,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:31,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:31,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:31,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:29" (1/3) ... [2019-10-15 00:11:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4c53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:31, skipping insertion in model container [2019-10-15 00:11:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:30" (2/3) ... [2019-10-15 00:11:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4c53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:31, skipping insertion in model container [2019-10-15 00:11:31,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:31" (3/3) ... [2019-10-15 00:11:31,035 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2019-10-15 00:11:31,045 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:31,054 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:11:31,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:11:31,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:31,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:31,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:31,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:31,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:31,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:31,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:31,109 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-15 00:11:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:11:31,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:31,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:31,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:31,151 INFO L82 PathProgramCache]: Analyzing trace with hash -53964180, now seen corresponding path program 1 times [2019-10-15 00:11:31,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:31,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080835477] [2019-10-15 00:11:31,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:31,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:31,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:31,333 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-15 00:11:31,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080835477] [2019-10-15 00:11:31,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:31,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:11:31,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189534160] [2019-10-15 00:11:31,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:31,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:31,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:31,360 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-15 00:11:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:31,378 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-15 00:11:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:31,379 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-15 00:11:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:31,388 INFO L225 Difference]: With dead ends: 33 [2019-10-15 00:11:31,388 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 00:11:31,391 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-15 00:11:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 00:11:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 00:11:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 00:11:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-15 00:11:31,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2019-10-15 00:11:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:31,431 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-15 00:11:31,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-10-15 00:11:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 00:11:31,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:31,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:31,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1423019225, now seen corresponding path program 1 times [2019-10-15 00:11:31,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:31,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616560223] [2019-10-15 00:11:31,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:31,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:31,827 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-15 00:11:31,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616560223] [2019-10-15 00:11:31,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:31,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 00:11:31,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013166316] [2019-10-15 00:11:31,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 00:11:31,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 00:11:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 00:11:31,831 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-10-15 00:11:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:32,159 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-15 00:11:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:32,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-15 00:11:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:32,163 INFO L225 Difference]: With dead ends: 33 [2019-10-15 00:11:32,163 INFO L226 Difference]: Without dead ends: 31 [2019-10-15 00:11:32,165 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-15 00:11:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-15 00:11:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-15 00:11:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 00:11:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-15 00:11:32,173 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-10-15 00:11:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-15 00:11:32,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 00:11:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-15 00:11:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 00:11:32,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:32,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:32,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1423021147, now seen corresponding path program 1 times [2019-10-15 00:11:32,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:32,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239876183] [2019-10-15 00:11:32,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:32,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:32,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:32,508 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-15 00:11:32,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239876183] [2019-10-15 00:11:32,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:32,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 00:11:32,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379984368] [2019-10-15 00:11:32,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 00:11:32,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:32,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 00:11:32,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:11:32,514 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2019-10-15 00:11:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:32,795 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-10-15 00:11:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:32,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-15 00:11:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:32,797 INFO L225 Difference]: With dead ends: 35 [2019-10-15 00:11:32,797 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 00:11:32,798 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-15 00:11:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 00:11:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-10-15 00:11:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 00:11:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-15 00:11:32,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2019-10-15 00:11:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:32,804 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-15 00:11:32,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 00:11:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-10-15 00:11:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 00:11:32,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:32,806 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:32,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -442037965, now seen corresponding path program 1 times [2019-10-15 00:11:32,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:32,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19749185] [2019-10-15 00:11:32,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:32,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:32,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:33,331 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-15 00:11:33,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19749185] [2019-10-15 00:11:33,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998455128] [2019-10-15 00:11:33,332 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-15 00:11:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:33,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-15 00:11:33,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:33,549 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-15 00:11:33,549 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-15 00:11:33,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:33,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:33,606 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-15 00:11:33,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:33,728 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-15 00:11:33,730 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-15 00:11:33,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:33,844 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-15 00:11:33,845 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.9 percent of original size [2019-10-15 00:11:33,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:33,875 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-15 00:11:33,876 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:33,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:33,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:33,945 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-15 00:11:33,946 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:33,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:34,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:34,051 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-10-15 00:11:34,051 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-15 00:11:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:34,057 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:34,178 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-15 00:11:34,179 INFO L567 ElimStorePlain]: treesize reduction 55, result has 63.8 percent of original size [2019-10-15 00:11:34,181 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-15 00:11:34,181 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:112, output treesize:96 [2019-10-15 00:11:34,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:34,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:34,402 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-15 00:11:34,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:34,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:34,454 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-15 00:11:34,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:34,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:34,498 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-15 00:11:34,499 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:34,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:34,544 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-15 00:11:34,546 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:35,804 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 98 [2019-10-15 00:11:35,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:35,808 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-15 00:11:35,822 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-15 00:11:35,836 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-15 00:11:35,849 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-15 00:11:35,860 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-15 00:11:37,794 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 116 [2019-10-15 00:11:37,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:37,807 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-15 00:11:37,832 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-15 00:11:37,848 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-15 00:11:37,861 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-15 00:11:39,423 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 118 [2019-10-15 00:11:39,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:39,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:39,567 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-15 00:11:39,568 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:39,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:39,674 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-15 00:11:39,675 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:39,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:39,755 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-15 00:11:39,756 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:39,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:39,817 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-15 00:11:39,819 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:41,298 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 112 [2019-10-15 00:11:41,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:41,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,458 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-15 00:11:41,459 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:41,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,640 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-15 00:11:41,642 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:41,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,797 INFO L235 Elim1Store]: Index analysis took 134 ms [2019-10-15 00:11:41,913 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-15 00:11:41,914 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:41,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:41,992 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-15 00:11:41,993 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:42,849 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-15 00:11:42,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:42,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:42,903 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-15 00:11:42,904 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:42,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:42,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, 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-15 00:11:42,967 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:42,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:43,023 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-15 00:11:43,024 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:43,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:43,069 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-15 00:11:43,070 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:43,833 WARN L191 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-15 00:11:43,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:43,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:43,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:43,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:43,971 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-15 00:11:43,973 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:43,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,189 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-15 00:11:44,191 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:44,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,299 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-15 00:11:44,300 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:44,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,366 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-15 00:11:44,367 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:44,966 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-15 00:11:44,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:44,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:44,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,021 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-15 00:11:45,023 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:45,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,290 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-15 00:11:45,291 INFO L341 Elim1Store]: treesize reduction 51, result has 72.4 percent of original size [2019-10-15 00:11:45,292 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-15 00:11:45,294 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:45,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,332 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-15 00:11:45,333 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:45,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:45,382 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-15 00:11:45,384 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:45,929 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-10-15 00:11:45,929 INFO L567 ElimStorePlain]: treesize reduction 95, result has 84.4 percent of original size [2019-10-15 00:11:45,938 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-15 00:11:45,938 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:962, output treesize:593 [2019-10-15 00:11:46,313 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-15 00:11:46,505 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-15 00:11:46,711 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-15 00:11:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 00:11:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 00:11:46,749 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-15 00:11:46,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:46,762 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-15 00:11:46,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:47,530 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 162 [2019-10-15 00:11:47,530 INFO L567 ElimStorePlain]: treesize reduction 30, result has 97.3 percent of original size [2019-10-15 00:11:47,540 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 00:11:47,542 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-15 00:11:47,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:47,871 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-10-15 00:11:47,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:47,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:47,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:47,924 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-15 00:11:47,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:47,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:47,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:47,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:47,930 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-15 00:11:48,601 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2019-10-15 00:11:48,602 INFO L567 ElimStorePlain]: treesize reduction 36, result has 96.6 percent of original size [2019-10-15 00:11:48,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:48,618 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-15 00:11:48,626 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:48,956 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-15 00:11:48,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:48,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:48,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:49,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:49,015 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-15 00:11:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:49,021 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-15 00:11:49,600 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2019-10-15 00:11:49,601 INFO L567 ElimStorePlain]: treesize reduction 44, result has 95.3 percent of original size [2019-10-15 00:11:49,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:49,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:49,618 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-15 00:11:49,629 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:49,911 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-15 00:11:49,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:49,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:49,937 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-15 00:11:49,939 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:49,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 00:11:49,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:49,998 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-15 00:11:50,018 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,037 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-15 00:11:50,038 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,060 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-15 00:11:50,061 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,075 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-15 00:11:50,077 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,738 WARN L191 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-10-15 00:11:50,739 INFO L567 ElimStorePlain]: treesize reduction 86, result has 89.1 percent of original size [2019-10-15 00:11:50,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:50,808 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-15 00:11:50,811 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:50,876 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-15 00:11:50,879 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:50,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:50,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:50,943 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-15 00:11:50,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:50,966 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-15 00:11:50,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:51,053 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-15 00:11:51,054 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:51,108 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-15 00:11:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,115 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-15 00:11:51,403 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-10-15 00:11:51,404 INFO L567 ElimStorePlain]: treesize reduction 198, result has 66.3 percent of original size [2019-10-15 00:11:51,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,421 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-15 00:11:51,421 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,443 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-15 00:11:51,445 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,462 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-15 00:11:51,464 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:51,482 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-15 00:11:51,483 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:51,493 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-15 00:11:51,495 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:51,617 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-15 00:11:51,618 INFO L567 ElimStorePlain]: treesize reduction 35, result has 78.3 percent of original size [2019-10-15 00:11:51,619 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-15 00:11:51,620 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:1165, output treesize:110 [2019-10-15 00:11:51,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 00:11:51,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,731 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-15 00:11:51,731 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:51,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:51,847 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-15 00:11:51,855 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-15 00:11:51,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:51,934 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-15 00:11:51,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:51,997 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-15 00:11:52,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:52,053 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-15 00:11:52,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:52,088 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-15 00:11:52,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:52,118 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-15 00:11:52,118 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:456, output treesize:633 [2019-10-15 00:11:52,241 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-15 00:11:52,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [552984817] [2019-10-15 00:11:52,247 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-10-15 00:11:52,279 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:11:52,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:11:52,333 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:11:52,335 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-15 00:11:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:52,340 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:11:52,374 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:11:52,375 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:11:52,376 INFO L553 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-10-15 00:11:52,376 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:11:52,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:11:52,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9, 8, 8] total 18 [2019-10-15 00:11:52,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877788342] [2019-10-15 00:11:52,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:52,378 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:52,378 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:11:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:52,379 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 2 states. [2019-10-15 00:11:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:52,381 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-10-15 00:11:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:52,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-15 00:11:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:52,382 INFO L225 Difference]: With dead ends: 26 [2019-10-15 00:11:52,382 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:11:52,382 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-15 00:11:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:11:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:11:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:11:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:11:52,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-10-15 00:11:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:52,383 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:11:52,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:11:52,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:11:52,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:52,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:11:52,605 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:52,606 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:52,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:52,606 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2019-10-15 00:11:52,606 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2019-10-15 00:11:52,606 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:11:52,607 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 591) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 565 593) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2019-10-15 00:11:52,607 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 588) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L585-2(lines 585 588) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 565 593) the Hoare annotation is: true [2019-10-15 00:11:52,608 INFO L439 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: false [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L590-2(lines 590 591) no Hoare annotation was computed. [2019-10-15 00:11:52,608 INFO L439 ceAbstractionStarter]: At program point L590-4(lines 584 592) the Hoare annotation is: false [2019-10-15 00:11:52,608 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 565 593) no Hoare annotation was computed. [2019-10-15 00:11:52,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:11:52 BoogieIcfgContainer [2019-10-15 00:11:52,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:11:52,624 INFO L168 Benchmark]: Toolchain (without parser) took 23004.00 ms. Allocated memory was 146.8 MB in the beginning and 316.7 MB in the end (delta: 169.9 MB). Free memory was 104.8 MB in the beginning and 173.7 MB in the end (delta: -69.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,625 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 146.8 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.22 ms. Allocated memory was 146.8 MB in the beginning and 207.1 MB in the end (delta: 60.3 MB). Free memory was 104.6 MB in the beginning and 174.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,626 INFO L168 Benchmark]: Boogie Preprocessor took 63.23 ms. Allocated memory is still 207.1 MB. Free memory was 174.1 MB in the beginning and 171.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,627 INFO L168 Benchmark]: RCFGBuilder took 625.03 ms. Allocated memory is still 207.1 MB. Free memory was 170.7 MB in the beginning and 128.1 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,628 INFO L168 Benchmark]: TraceAbstraction took 21594.67 ms. Allocated memory was 207.1 MB in the beginning and 316.7 MB in the end (delta: 109.6 MB). Free memory was 127.5 MB in the beginning and 173.7 MB in the end (delta: -46.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:52,630 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.26 ms. Allocated memory is still 146.8 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.22 ms. Allocated memory was 146.8 MB in the beginning and 207.1 MB in the end (delta: 60.3 MB). Free memory was 104.6 MB in the beginning and 174.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.23 ms. Allocated memory is still 207.1 MB. Free memory was 174.1 MB in the beginning and 171.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.03 ms. Allocated memory is still 207.1 MB. Free memory was 170.7 MB in the beginning and 128.1 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21594.67 ms. Allocated memory was 207.1 MB in the beginning and 316.7 MB in the end (delta: 109.6 MB). Free memory was 127.5 MB in the beginning and 173.7 MB in the end (delta: -46.3 MB). Peak memory consumption was 63.3 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.5s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.6s, 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.8s 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]: 94, 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...