/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:08:49,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:08:49,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:08:49,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:08:49,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:08:49,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:08:49,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:08:49,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:08:49,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:08:49,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:08:49,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:08:49,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:08:49,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:08:49,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:08:49,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:08:49,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:08:49,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:08:49,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:08:49,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:08:49,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:08:49,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:08:49,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:08:49,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:08:49,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:08:49,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:08:49,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:08:49,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:08:49,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:08:49,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:08:49,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:08:49,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:08:49,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:08:49,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:08:49,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:08:49,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:08:49,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:08:49,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:08:49,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:08:49,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:08:49,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:08:49,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:08:49,107 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 [2020-07-10 15:08:49,122 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:08:49,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:08:49,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:08:49,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:08:49,124 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:08:49,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:08:49,124 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:08:49,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:08:49,127 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:08:49,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:08:49,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:08:49,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:08:49,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:08:49,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:08:49,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:08:49,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:08:49,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:49,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:08:49,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:08:49,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:08:49,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:08:49,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:08:49,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:08:49,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:08:49,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:08:49,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:08:49,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:08:49,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:08:49,440 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:08:49,441 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:08:49,442 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-10 15:08:49,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f531b62d2/89b80a8e6b394611abdc25dc4307fe4f/FLAGb842fcf31 [2020-07-10 15:08:50,074 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:08:50,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-10 15:08:50,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f531b62d2/89b80a8e6b394611abdc25dc4307fe4f/FLAGb842fcf31 [2020-07-10 15:08:50,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f531b62d2/89b80a8e6b394611abdc25dc4307fe4f [2020-07-10 15:08:50,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:08:50,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:08:50,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:50,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:08:50,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:08:50,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:50" (1/1) ... [2020-07-10 15:08:50,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbc0375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:50, skipping insertion in model container [2020-07-10 15:08:50,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:50" (1/1) ... [2020-07-10 15:08:50,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:08:50,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:08:50,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:50,926 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:08:51,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:51,067 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:08:51,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51 WrapperNode [2020-07-10 15:08:51,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:51,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:08:51,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:08:51,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:08:51,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (1/1) ... [2020-07-10 15:08:51,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:08:51,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:08:51,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:08:51,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:08:51,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (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 [2020-07-10 15:08:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:08:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:08:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:08:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:08:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:08:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:08:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:08:51,227 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:08:51,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:08:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:08:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:08:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:08:51,229 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:08:51,229 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:08:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:08:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:08:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:08:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:08:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:08:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:08:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:08:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:08:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:08:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:08:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:08:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:08:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:08:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:08:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:08:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:08:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:08:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:08:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:08:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:08:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:08:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:08:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:08:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:08:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:08:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:08:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:08:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:08:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:08:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:08:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:08:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:08:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:08:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:08:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:08:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:08:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:08:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:08:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:08:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:08:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:08:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:08:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:08:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:08:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:08:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:08:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:08:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:08:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:08:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:08:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:08:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:08:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:08:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:08:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:08:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:08:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:08:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:08:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:08:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:08:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:08:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:08:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:08:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:08:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:08:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:08:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:08:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:08:52,025 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:08:52,026 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-10 15:08:52,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:52 BoogieIcfgContainer [2020-07-10 15:08:52,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:08:52,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:08:52,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:08:52,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:08:52,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:08:50" (1/3) ... [2020-07-10 15:08:52,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7929dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:52, skipping insertion in model container [2020-07-10 15:08:52,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:51" (2/3) ... [2020-07-10 15:08:52,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7929dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:52, skipping insertion in model container [2020-07-10 15:08:52,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:52" (3/3) ... [2020-07-10 15:08:52,045 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2020-07-10 15:08:52,057 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:08:52,065 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-10 15:08:52,081 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-10 15:08:52,104 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:08:52,105 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:08:52,105 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:08:52,105 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:08:52,105 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:08:52,106 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:08:52,106 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:08:52,106 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:08:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-10 15:08:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:08:52,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:52,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:52,135 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash -742552803, now seen corresponding path program 1 times [2020-07-10 15:08:52,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:52,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370887995] [2020-07-10 15:08:52,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:52,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#true} is VALID [2020-07-10 15:08:52,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:08:52,375 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #136#return; {41#true} is VALID [2020-07-10 15:08:52,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:52,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#true} is VALID [2020-07-10 15:08:52,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:08:52,381 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #136#return; {41#true} is VALID [2020-07-10 15:08:52,381 INFO L263 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret17 := main(); {41#true} is VALID [2020-07-10 15:08:52,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {41#true} is VALID [2020-07-10 15:08:52,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-10 15:08:52,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {42#false} is VALID [2020-07-10 15:08:52,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {42#false} is VALID [2020-07-10 15:08:52,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-10 15:08:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:52,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370887995] [2020-07-10 15:08:52,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:52,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:08:52,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656809438] [2020-07-10 15:08:52,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:52,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:52,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:08:52,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:52,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:08:52,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:08:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:08:52,475 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-10 15:08:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:52,714 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2020-07-10 15:08:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:08:52,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-10 15:08:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-10 15:08:52,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2020-07-10 15:08:52,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:52,883 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:08:52,883 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:08:52,887 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:08:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:08:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 15:08:52,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:52,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 15:08:52,930 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:08:52,930 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:08:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:52,936 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-10 15:08:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:08:52,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:08:52,937 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:08:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:52,941 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-10 15:08:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:08:52,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:52,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:52,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:52,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:08:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:08:52,948 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2020-07-10 15:08:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:52,948 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:08:52,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:08:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:08:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:08:52,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:52,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:52,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:08:52,950 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1556669446, now seen corresponding path program 1 times [2020-07-10 15:08:52,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:52,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835895111] [2020-07-10 15:08:52,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:53,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-10 15:08:53,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 15:08:53,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #136#return; {225#true} is VALID [2020-07-10 15:08:53,095 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:53,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-10 15:08:53,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 15:08:53,096 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #136#return; {225#true} is VALID [2020-07-10 15:08:53,096 INFO L263 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret17 := main(); {225#true} is VALID [2020-07-10 15:08:53,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 15:08:53,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(not (= main_~list~0.base main_~null~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 15:08:53,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#(not (= main_~list~0.base main_~null~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 15:08:53,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {231#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 15:08:53,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {226#false} is VALID [2020-07-10 15:08:53,105 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 15:08:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:53,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835895111] [2020-07-10 15:08:53,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:53,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:53,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393128373] [2020-07-10 15:08:53,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:53,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:53,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:53,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:53,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:53,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:53,133 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2020-07-10 15:08:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:53,449 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-10 15:08:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:53,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 15:08:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 15:08:53,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-10 15:08:53,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:53,529 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:08:53,530 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:08:53,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:08:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2020-07-10 15:08:53,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:53,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 29 states. [2020-07-10 15:08:53,550 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 29 states. [2020-07-10 15:08:53,550 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 29 states. [2020-07-10 15:08:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:53,555 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:08:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:08:53,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:53,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:53,556 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 35 states. [2020-07-10 15:08:53,556 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 35 states. [2020-07-10 15:08:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:53,560 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:08:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:08:53,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:53,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:53,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:53,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:08:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-10 15:08:53,564 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2020-07-10 15:08:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:53,564 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-10 15:08:53,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-10 15:08:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:08:53,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:53,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:53,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:08:53,566 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1973625457, now seen corresponding path program 1 times [2020-07-10 15:08:53,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:53,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344479647] [2020-07-10 15:08:53,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:53,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {396#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {388#true} is VALID [2020-07-10 15:08:53,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-10 15:08:53,778 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #136#return; {388#true} is VALID [2020-07-10 15:08:53,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {396#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:53,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {388#true} is VALID [2020-07-10 15:08:53,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-10 15:08:53,781 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} #136#return; {388#true} is VALID [2020-07-10 15:08:53,781 INFO L263 TraceCheckUtils]: 4: Hoare triple {388#true} call #t~ret17 := main(); {388#true} is VALID [2020-07-10 15:08:53,784 INFO L280 TraceCheckUtils]: 5: Hoare triple {388#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:53,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:53,786 INFO L280 TraceCheckUtils]: 7: Hoare triple {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:53,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {393#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:53,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:53,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:53,790 INFO L280 TraceCheckUtils]: 11: Hoare triple {394#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {395#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 15:08:53,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {395#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {389#false} is VALID [2020-07-10 15:08:53,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {389#false} assume !false; {389#false} is VALID [2020-07-10 15:08:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:53,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344479647] [2020-07-10 15:08:53,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:53,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:53,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199747773] [2020-07-10 15:08:53,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:08:53,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:53,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:53,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:53,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:53,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:53,819 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2020-07-10 15:08:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:54,232 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-10 15:08:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:08:54,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:08:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 15:08:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 15:08:54,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2020-07-10 15:08:54,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:54,337 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:08:54,337 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:08:54,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:08:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:08:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2020-07-10 15:08:54,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:54,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 36 states. [2020-07-10 15:08:54,369 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 36 states. [2020-07-10 15:08:54,369 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 36 states. [2020-07-10 15:08:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:54,378 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:08:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:08:54,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:54,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:54,380 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 52 states. [2020-07-10 15:08:54,380 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 52 states. [2020-07-10 15:08:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:54,385 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:08:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:08:54,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:54,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:54,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:54,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:08:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-10 15:08:54,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 14 [2020-07-10 15:08:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:54,390 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-10 15:08:54,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:08:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:08:54,391 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:54,391 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:54,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:08:54,391 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash -954667545, now seen corresponding path program 1 times [2020-07-10 15:08:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:54,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453696482] [2020-07-10 15:08:54,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:54,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {626#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:08:54,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:08:54,740 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {616#true} {616#true} #136#return; {616#true} is VALID [2020-07-10 15:08:54,741 INFO L263 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {626#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:54,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {626#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:08:54,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:08:54,742 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #136#return; {616#true} is VALID [2020-07-10 15:08:54,742 INFO L263 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret17 := main(); {616#true} is VALID [2020-07-10 15:08:54,745 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {621#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 15:08:54,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {621#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {621#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 15:08:54,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {621#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {622#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:54,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {622#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:54,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:54,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:54,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {623#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:54,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:54,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:54,758 INFO L280 TraceCheckUtils]: 14: Hoare triple {624#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {625#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 15:08:54,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {617#false} is VALID [2020-07-10 15:08:54,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {617#false} assume !false; {617#false} is VALID [2020-07-10 15:08:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:54,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453696482] [2020-07-10 15:08:54,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104875887] [2020-07-10 15:08:54,761 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 [2020-07-10 15:08:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:54,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-10 15:08:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:54,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:08:55,031 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-10 15:08:55,032 INFO L384 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 [2020-07-10 15:08:55,032 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,044 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,052 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-10 15:08:55,052 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,064 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,066 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:55,067 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2020-07-10 15:08:55,074 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:55,075 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|, |main_#t~malloc0.base|, |v_#memory_int_27|]. (and (= |#valid| (store (store |v_#valid_21| |main_#t~malloc0.base| 1) main_~list~0.base 1)) (= (store |v_#memory_int_27| main_~list~0.base (store (select |v_#memory_int_27| main_~list~0.base) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (<= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)) [2020-07-10 15:08:55,075 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc0.base|]. (and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| |main_#t~malloc0.base|))) [2020-07-10 15:08:55,178 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,179 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-10 15:08:55,181 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,228 INFO L624 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2020-07-10 15:08:55,235 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:55,252 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:08:55,264 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2020-07-10 15:08:55,266 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,277 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,284 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,284 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:24 [2020-07-10 15:08:55,290 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:55,290 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, v_main_~end~0.offset_23, |v_#memory_int_31|, |v_#valid_22|]. (let ((.cse0 (select |v_#memory_int_31| main_~list~0.base))) (and (= 0 (select |v_#valid_22| main_~end~0.base)) (= (store |v_#memory_int_31| main_~list~0.base (store .cse0 v_main_~end~0.offset_23 (select (select |v_#memory_int_28| main_~list~0.base) v_main_~end~0.offset_23))) |v_#memory_int_28|) (= |#valid| (store |v_#valid_22| main_~end~0.base 1)) (= 1 (select |v_#valid_22| main_~list~0.base)) (= |#memory_int| (store |v_#memory_int_28| main_~end~0.base (store (select |v_#memory_int_28| main_~end~0.base) main_~end~0.offset (select (select |#memory_int| main_~end~0.base) main_~end~0.offset)))) (<= v_main_~end~0.offset_23 main_~list~0.offset) (= ~unnamed1~0~BLACK (select .cse0 (+ main_~list~0.offset 4))))) [2020-07-10 15:08:55,290 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base))) [2020-07-10 15:08:55,403 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-10 15:08:55,406 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,435 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,439 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_29|, |v_#memory_int_30|], 4=[|v_#memory_int_32|]} [2020-07-10 15:08:55,443 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:55,471 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,477 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:55,502 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:08:55,546 INFO L350 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2020-07-10 15:08:55,547 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2020-07-10 15:08:55,550 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:55,568 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:55,600 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:55,600 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:77, output treesize:40 [2020-07-10 15:08:55,612 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:55,613 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, |main_#t~malloc6.base|, main_~end~0.offset, |v_#memory_int_30|, v_main_~end~0.base_24, |v_#valid_23|, |v_#memory_int_32|, v_main_~end~0.offset_24]. (let ((.cse0 (select |v_#memory_int_29| |main_#t~malloc6.base|))) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= |v_#memory_int_29| (store |v_#memory_int_30| |main_#t~malloc6.base| (store (select |v_#memory_int_30| |main_#t~malloc6.base|) main_~end~0.offset (select .cse0 main_~end~0.offset)))) (= 1 (select |v_#valid_23| main_~list~0.base)) (= 0 (select |v_#valid_23| |main_#t~malloc6.base|)) (= 1 (select |v_#valid_23| v_main_~end~0.base_24)) (= ~unnamed1~0~BLACK (select (select |v_#memory_int_32| main_~list~0.base) (+ main_~list~0.offset 4))) (= (store |v_#memory_int_29| |main_#t~malloc6.base| (store .cse0 (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |v_#memory_int_32| v_main_~end~0.base_24 (store (store (select |v_#memory_int_32| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4) ~unnamed1~0~RED) v_main_~end~0.offset_24 (select (select |v_#memory_int_30| v_main_~end~0.base_24) v_main_~end~0.offset_24))) |v_#memory_int_30|))) [2020-07-10 15:08:55,613 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc6.base|, main_~end~0.offset, v_main_~end~0.base_24, v_main_~end~0.offset_24]. (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED)) [2020-07-10 15:08:56,131 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-07-10 15:08:56,132 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:56,140 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:56,143 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:08:56,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-10 15:08:56,147 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:56,147 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset, |main_#t~malloc6.base|, v_prenex_1, v_main_~end~0.base_24, v_main_~end~0.offset_24]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= .cse0 |main_#t~mem8|) (= .cse0 ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) [2020-07-10 15:08:56,147 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem8|) [2020-07-10 15:08:56,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {616#true} is VALID [2020-07-10 15:08:56,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:08:56,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:08:56,150 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #136#return; {616#true} is VALID [2020-07-10 15:08:56,150 INFO L263 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret17 := main(); {616#true} is VALID [2020-07-10 15:08:56,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {645#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:56,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {645#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:56,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {652#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:08:56,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:56,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:56,167 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:56,169 INFO L280 TraceCheckUtils]: 11: Hoare triple {656#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-10 15:08:56,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-10 15:08:56,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} goto; {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-10 15:08:56,172 INFO L280 TraceCheckUtils]: 14: Hoare triple {666#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {625#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 15:08:56,173 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {617#false} is VALID [2020-07-10 15:08:56,173 INFO L280 TraceCheckUtils]: 16: Hoare triple {617#false} assume !false; {617#false} is VALID [2020-07-10 15:08:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:56,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:08:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-10 15:08:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593015450] [2020-07-10 15:08:56,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-10 15:08:56,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:08:56,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:56,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:08:56,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:08:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:08:56,236 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 12 states. [2020-07-10 15:09:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:20,057 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2020-07-10 15:09:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:09:20,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-10 15:09:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:09:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2020-07-10 15:09:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:09:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2020-07-10 15:09:20,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2020-07-10 15:09:20,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:20,207 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:09:20,207 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:09:20,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:09:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:09:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 27. [2020-07-10 15:09:20,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:20,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 27 states. [2020-07-10 15:09:20,239 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 27 states. [2020-07-10 15:09:20,240 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 27 states. [2020-07-10 15:09:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:20,244 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-10 15:09:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2020-07-10 15:09:20,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:20,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:20,247 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 60 states. [2020-07-10 15:09:20,248 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 60 states. [2020-07-10 15:09:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:20,254 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-10 15:09:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2020-07-10 15:09:20,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:20,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:20,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:20,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:09:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-10 15:09:20,259 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2020-07-10 15:09:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:20,259 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-10 15:09:20,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:09:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 15:09:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:09:20,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:20,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:20,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:20,477 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 903516662, now seen corresponding path program 1 times [2020-07-10 15:09:20,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:20,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963581528] [2020-07-10 15:09:20,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:20,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {923#true} is VALID [2020-07-10 15:09:20,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {923#true} assume true; {923#true} is VALID [2020-07-10 15:09:20,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {923#true} {923#true} #136#return; {923#true} is VALID [2020-07-10 15:09:20,668 INFO L263 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {931#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:20,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {923#true} is VALID [2020-07-10 15:09:20,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2020-07-10 15:09:20,669 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #136#return; {923#true} is VALID [2020-07-10 15:09:20,669 INFO L263 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret17 := main(); {923#true} is VALID [2020-07-10 15:09:20,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {923#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {923#true} is VALID [2020-07-10 15:09:20,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {923#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {923#true} is VALID [2020-07-10 15:09:20,670 INFO L280 TraceCheckUtils]: 7: Hoare triple {923#true} assume !(0 != #t~nondet2);havoc #t~nondet2; {923#true} is VALID [2020-07-10 15:09:20,670 INFO L280 TraceCheckUtils]: 8: Hoare triple {923#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {923#true} is VALID [2020-07-10 15:09:20,671 INFO L280 TraceCheckUtils]: 9: Hoare triple {923#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {923#true} is VALID [2020-07-10 15:09:20,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {923#true} goto; {923#true} is VALID [2020-07-10 15:09:20,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {923#true} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {928#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} is VALID [2020-07-10 15:09:20,672 INFO L280 TraceCheckUtils]: 12: Hoare triple {928#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {929#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:09:20,673 INFO L280 TraceCheckUtils]: 13: Hoare triple {929#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {929#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:09:20,674 INFO L280 TraceCheckUtils]: 14: Hoare triple {929#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {930#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-10 15:09:20,675 INFO L280 TraceCheckUtils]: 15: Hoare triple {930#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {924#false} is VALID [2020-07-10 15:09:20,675 INFO L280 TraceCheckUtils]: 16: Hoare triple {924#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {924#false} is VALID [2020-07-10 15:09:20,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {924#false} assume !false; {924#false} is VALID [2020-07-10 15:09:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:20,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963581528] [2020-07-10 15:09:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:09:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264902193] [2020-07-10 15:09:20,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:09:20,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:20,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:09:20,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:20,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:09:20,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:20,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:09:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:09:20,699 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2020-07-10 15:09:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:21,042 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-10 15:09:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:09:21,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:09:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 15:09:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 15:09:21,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-10 15:09:21,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:21,101 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:09:21,101 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:09:21,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:09:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:09:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 15:09:21,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:21,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 15:09:21,130 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 15:09:21,131 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 15:09:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:21,133 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:09:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:09:21,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:21,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:21,134 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 15:09:21,134 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 15:09:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:21,136 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:09:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:09:21,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:21,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:21,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:21,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:09:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-10 15:09:21,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2020-07-10 15:09:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:21,139 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-10 15:09:21,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:09:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-10 15:09:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:09:21,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:21,140 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:21,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:09:21,140 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:21,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1223911862, now seen corresponding path program 1 times [2020-07-10 15:09:21,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:21,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657092682] [2020-07-10 15:09:21,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:21,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#true} is VALID [2020-07-10 15:09:21,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1082#true} assume true; {1082#true} is VALID [2020-07-10 15:09:21,326 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1082#true} {1082#true} #136#return; {1082#true} is VALID [2020-07-10 15:09:21,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {1082#true} call ULTIMATE.init(); {1092#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:21,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {1092#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#true} is VALID [2020-07-10 15:09:21,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#true} assume true; {1082#true} is VALID [2020-07-10 15:09:21,331 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1082#true} {1082#true} #136#return; {1082#true} is VALID [2020-07-10 15:09:21,331 INFO L263 TraceCheckUtils]: 4: Hoare triple {1082#true} call #t~ret17 := main(); {1082#true} is VALID [2020-07-10 15:09:21,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {1082#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-10 15:09:21,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-10 15:09:21,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-10 15:09:21,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {1087#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1088#(or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))))} is VALID [2020-07-10 15:09:21,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {1088#(or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} goto; {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} goto; {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,344 INFO L280 TraceCheckUtils]: 15: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} is VALID [2020-07-10 15:09:21,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {1089#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1090#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} is VALID [2020-07-10 15:09:21,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {1090#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1090#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} is VALID [2020-07-10 15:09:21,351 INFO L280 TraceCheckUtils]: 18: Hoare triple {1090#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1091#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:21,352 INFO L280 TraceCheckUtils]: 19: Hoare triple {1091#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1083#false} is VALID [2020-07-10 15:09:21,352 INFO L280 TraceCheckUtils]: 20: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2020-07-10 15:09:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:21,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657092682] [2020-07-10 15:09:21,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541945806] [2020-07-10 15:09:21,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:21,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:09:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:21,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:21,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:21,536 INFO L350 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2020-07-10 15:09:21,536 INFO L384 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 1 case distinctions, treesize of input 38 treesize of output 48 [2020-07-10 15:09:21,537 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:21,585 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2020-07-10 15:09:21,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:21,652 INFO L350 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2020-07-10 15:09:21,653 INFO L384 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 1 case distinctions, treesize of input 38 treesize of output 48 [2020-07-10 15:09:21,653 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:21,713 INFO L624 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2020-07-10 15:09:21,714 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:21,714 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2020-07-10 15:09:23,893 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:23,894 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]. (let ((.cse1 (+ main_~list~0.offset 4))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.base_24| main_~null~0.base (store (select |v_#memory_$Pointer$.base_24| main_~null~0.base) main_~null~0.offset 0)))) (store .cse0 main_~list~0.base (store (store (select .cse0 main_~list~0.base) main_~list~0.offset main_~null~0.base) .cse1 (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse1)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (let ((.cse2 (store |v_#memory_$Pointer$.offset_24| main_~null~0.base (store (select |v_#memory_$Pointer$.offset_24| main_~null~0.base) main_~null~0.offset 0)))) (store .cse2 main_~list~0.base (store (store (select .cse2 main_~list~0.base) main_~list~0.offset main_~null~0.offset) .cse1 (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse1))))))) [2020-07-10 15:09:23,894 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (= main_~list~0.base main_~null~0.base))) (let ((.cse0 (and (= (+ main_~list~0.offset 4) main_~null~0.offset) .cse2)) (.cse1 (and .cse2 (= main_~list~0.offset main_~null~0.offset)))) (and (or .cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) .cse1) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or .cse0 (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) .cse1)))) [2020-07-10 15:09:24,107 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-10 15:09:24,110 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-10 15:09:24,154 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-10 15:09:24,156 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,171 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:24,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-07-10 15:09:24,177 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:09:24,186 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,235 INFO L624 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2020-07-10 15:09:24,247 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:09:24,248 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,258 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:24,259 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-07-10 15:09:24,261 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,266 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-10 15:09:24,273 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,284 INFO L624 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2020-07-10 15:09:24,285 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:24,285 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2020-07-10 15:09:24,292 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:24,292 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~end~0.base_25, v_main_~end~0.offset_25, |#memory_$Pointer$.base|]. (let ((.cse4 (select |#memory_$Pointer$.base| main_~null~0.base)) (.cse2 (select |#memory_$Pointer$.offset| main_~null~0.base))) (let ((.cse7 (select .cse2 main_~null~0.offset)) (.cse8 (select .cse4 main_~null~0.offset))) (or (let ((.cse3 (+ main_~null~0.offset (- 4)))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (select .cse2 .cse3))) (and (= .cse0 main_~end~0.base) (= .cse0 main_~null~0.base) (= main_~null~0.offset .cse1) (= main_~end~0.offset .cse1)))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_25) v_main_~end~0.offset_25)) (.cse6 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_25) v_main_~end~0.offset_25))) (and (= main_~end~0.offset .cse5) (= .cse5 main_~null~0.offset) (= .cse6 main_~end~0.base) (= .cse6 main_~null~0.base) (= 0 .cse7) (= 0 .cse8))) (and (= main_~end~0.offset .cse7) (= .cse8 main_~end~0.base) (= main_~null~0.offset .cse7) (= .cse8 main_~null~0.base))))) [2020-07-10 15:09:24,292 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) [2020-07-10 15:09:24,320 INFO L263 TraceCheckUtils]: 0: Hoare triple {1082#true} call ULTIMATE.init(); {1082#true} is VALID [2020-07-10 15:09:24,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {1082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#true} is VALID [2020-07-10 15:09:24,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#true} assume true; {1082#true} is VALID [2020-07-10 15:09:24,321 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1082#true} {1082#true} #136#return; {1082#true} is VALID [2020-07-10 15:09:24,321 INFO L263 TraceCheckUtils]: 4: Hoare triple {1082#true} call #t~ret17 := main(); {1082#true} is VALID [2020-07-10 15:09:24,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {1082#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {1111#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} goto; {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} goto; {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,335 INFO L280 TraceCheckUtils]: 14: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,336 INFO L280 TraceCheckUtils]: 15: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-10 15:09:24,337 INFO L280 TraceCheckUtils]: 16: Hoare triple {1121#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1146#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:24,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {1146#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1083#false} is VALID [2020-07-10 15:09:24,345 INFO L280 TraceCheckUtils]: 18: Hoare triple {1083#false} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1083#false} is VALID [2020-07-10 15:09:24,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {1083#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1083#false} is VALID [2020-07-10 15:09:24,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2020-07-10 15:09:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:24,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:24,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-07-10 15:09:24,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188109626] [2020-07-10 15:09:24,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-10 15:09:24,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:24,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:09:24,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:24,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:09:24,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:09:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:09:24,403 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2020-07-10 15:09:24,642 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-07-10 15:09:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:25,605 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-10 15:09:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:09:25,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-10 15:09:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:09:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-10 15:09:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:09:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-10 15:09:25,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2020-07-10 15:09:25,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:25,710 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:09:25,711 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:09:25,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:09:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:09:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-10 15:09:25,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:25,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-10 15:09:25,758 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-10 15:09:25,758 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-10 15:09:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:25,760 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:09:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:09:25,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:25,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:25,761 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-10 15:09:25,761 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-10 15:09:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:25,763 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:09:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:09:25,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:25,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:25,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:25,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:09:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:09:25,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2020-07-10 15:09:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:25,766 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:09:25,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:09:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:09:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:09:25,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:25,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:25,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:25,979 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1223476830, now seen corresponding path program 1 times [2020-07-10 15:09:25,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:25,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368004009] [2020-07-10 15:09:25,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:26,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {1354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1341#true} is VALID [2020-07-10 15:09:26,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {1341#true} assume true; {1341#true} is VALID [2020-07-10 15:09:26,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1341#true} {1341#true} #136#return; {1341#true} is VALID [2020-07-10 15:09:26,368 INFO L263 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:26,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {1354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1341#true} is VALID [2020-07-10 15:09:26,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2020-07-10 15:09:26,369 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #136#return; {1341#true} is VALID [2020-07-10 15:09:26,369 INFO L263 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret17 := main(); {1341#true} is VALID [2020-07-10 15:09:26,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {1341#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:26,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:26,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1347#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~list~0.base)) (or (= main_~list~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:26,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {1347#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~list~0.base)) (or (= main_~list~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:26,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:26,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:26,383 INFO L280 TraceCheckUtils]: 11: Hoare triple {1348#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1349#(and (= 0 main_~null~0.offset) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))) (= main_~end~0.offset main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 15:09:26,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {1349#(and (= 0 main_~null~0.offset) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))) (= main_~end~0.offset main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} goto; {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,387 INFO L280 TraceCheckUtils]: 15: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} goto; {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,389 INFO L280 TraceCheckUtils]: 17: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,389 INFO L280 TraceCheckUtils]: 18: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-10 15:09:26,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {1350#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1351#(and (= 0 main_~null~0.offset) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 15:09:26,391 INFO L280 TraceCheckUtils]: 20: Hoare triple {1351#(and (= 0 main_~null~0.offset) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (= 0 main_~end~0.offset))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1352#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} is VALID [2020-07-10 15:09:26,392 INFO L280 TraceCheckUtils]: 21: Hoare triple {1352#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1353#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:26,393 INFO L280 TraceCheckUtils]: 22: Hoare triple {1353#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1342#false} is VALID [2020-07-10 15:09:26,393 INFO L280 TraceCheckUtils]: 23: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2020-07-10 15:09:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:26,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368004009] [2020-07-10 15:09:26,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978486485] [2020-07-10 15:09:26,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:26,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-10 15:09:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:26,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:26,584 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-10 15:09:26,585 INFO L384 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 [2020-07-10 15:09:26,585 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,603 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:26,604 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,604 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2020-07-10 15:09:26,607 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:26,608 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_24|]. (and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= |#valid| (store (store |v_#valid_24| main_~null~0.base 1) main_~list~0.base 1))) [2020-07-10 15:09:26,608 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base))) [2020-07-10 15:09:26,713 INFO L350 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2020-07-10 15:09:26,713 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2020-07-10 15:09:26,716 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,784 INFO L624 ElimStorePlain]: treesize reduction 28, result has 75.7 percent of original size [2020-07-10 15:09:26,803 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:09:26,804 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,859 INFO L624 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2020-07-10 15:09:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:26,871 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:09:26,872 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,895 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:26,895 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:26,896 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:57 [2020-07-10 15:09:27,045 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:27,045 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_26|, |v_#valid_25|, |v_#memory_$Pointer$.base_26|]. (and (= |#memory_$Pointer$.offset| (let ((.cse0 (store |v_#memory_$Pointer$.offset_26| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_26| main_~list~0.base) main_~list~0.offset 0)))) (store .cse0 main_~end~0.base (store (select .cse0 main_~end~0.base) main_~end~0.offset main_~null~0.offset)))) (= 1 (select |v_#valid_25| main_~list~0.base)) (= 1 (select |v_#valid_25| main_~null~0.base)) (= 0 main_~null~0.offset) (= (let ((.cse1 (store |v_#memory_$Pointer$.base_26| main_~list~0.base (store (select |v_#memory_$Pointer$.base_26| main_~list~0.base) main_~list~0.offset main_~end~0.base)))) (store .cse1 main_~end~0.base (store (select .cse1 main_~end~0.base) main_~end~0.offset main_~null~0.base))) |#memory_$Pointer$.base|) (= 0 main_~end~0.offset) (= main_~list~0.offset main_~null~0.offset) (= |#valid| (store |v_#valid_25| main_~end~0.base 1)) (= 0 (select |v_#valid_25| main_~end~0.base))) [2020-07-10 15:09:27,046 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base))) [2020-07-10 15:09:27,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:27,254 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,255 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 49 [2020-07-10 15:09:27,257 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:27,354 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,357 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|, |v_#memory_int_35|], 2=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.offset_27|]} [2020-07-10 15:09:27,363 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:27,447 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2020-07-10 15:09:27,464 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:27,529 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,540 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2020-07-10 15:09:27,541 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:27,610 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,615 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:09:27,666 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,795 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2020-07-10 15:09:27,796 INFO L350 Elim1Store]: treesize reduction 124, result has 41.2 percent of original size [2020-07-10 15:09:27,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 161 [2020-07-10 15:09:27,811 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-07-10 15:09:27,812 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:27,825 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:27,925 INFO L624 ElimStorePlain]: treesize reduction 82, result has 65.5 percent of original size [2020-07-10 15:09:27,931 INFO L544 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:09:27,969 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:27,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:27,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:28,002 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2020-07-10 15:09:28,008 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:28,036 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:28,042 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:09:28,042 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:272, output treesize:89 [2020-07-10 15:09:28,157 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:28,157 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|, |main_#t~malloc6.offset|, main_~end~0.base, main_~end~0.offset, |v_#memory_$Pointer$.offset_27|, |v_#memory_int_35|, |v_#memory_int_34|, |v_#valid_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_int_33|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_27| main_~list~0.base) main_~list~0.offset))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_25| .cse0)) (.cse1 (select |v_#memory_$Pointer$.offset_27| .cse0)) (.cse4 (+ main_~end~0.offset 4)) (.cse6 (select |v_#memory_$Pointer$.base_25| .cse0)) (.cse7 (select |v_#memory_$Pointer$.base_27| .cse0))) (and (= (store |v_#memory_$Pointer$.offset_27| .cse0 (store .cse1 4 (select .cse2 4))) |v_#memory_$Pointer$.offset_25|) (= 0 main_~list~0.offset) (= (store |v_#memory_int_35| .cse0 (store (store (select |v_#memory_int_35| .cse0) 4 ~unnamed1~0~RED) 0 (select (select |v_#memory_int_34| .cse0) 0))) |v_#memory_int_34|) (= |#memory_$Pointer$.offset| (let ((.cse3 (store |v_#memory_$Pointer$.offset_25| .cse0 (store .cse2 0 |main_#t~malloc6.offset|)))) (store .cse3 main_~end~0.base (store (store (select .cse3 main_~end~0.base) main_~end~0.offset 0) .cse4 (select (select |#memory_$Pointer$.offset| main_~end~0.base) .cse4))))) (= (select (select |v_#memory_$Pointer$.offset_27| main_~list~0.base) main_~list~0.offset) 0) (= 0 (select |v_#valid_26| main_~end~0.base)) (= 1 (select |v_#valid_26| main_~null~0.base)) (= 0 (select .cse1 0)) (= 1 (select |v_#valid_26| main_~list~0.base)) (= |#memory_$Pointer$.base| (let ((.cse5 (store |v_#memory_$Pointer$.base_25| .cse0 (store .cse6 0 main_~end~0.base)))) (store .cse5 main_~end~0.base (store (store (select .cse5 main_~end~0.base) main_~end~0.offset main_~null~0.base) .cse4 (select (select |#memory_$Pointer$.base| main_~end~0.base) .cse4))))) (= (store |v_#memory_int_34| main_~end~0.base (store (select |v_#memory_int_34| main_~end~0.base) main_~end~0.offset (select (select |v_#memory_int_33| main_~end~0.base) main_~end~0.offset))) |v_#memory_int_33|) (= |v_#memory_$Pointer$.base_25| (store |v_#memory_$Pointer$.base_27| .cse0 (store .cse7 4 (select .cse6 4)))) (not (= .cse0 main_~null~0.base)) (= 1 (select |v_#valid_26| .cse0)) (= (select .cse7 0) main_~null~0.base)))) [2020-07-10 15:09:28,158 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~end~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (not (= .cse0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= .cse1 main_~null~0.base)) (not (= .cse0 .cse1)) (= (select (select |#memory_$Pointer$.base| .cse1) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) main_~end~0.offset)) (not (= main_~list~0.base .cse1))))) [2020-07-10 15:09:28,528 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2020-07-10 15:09:28,530 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:28,547 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:28,549 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-10 15:09:28,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:74 [2020-07-10 15:09:28,555 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:28,556 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_main_~end~0.base_28, v_subst_3, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_28) 0)) (.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 main_~end~0.base) (not (= .cse1 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse1) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse1)) (not (= .cse1 .cse0)) (= .cse2 main_~end~0.offset) (= 0 .cse2) (not (= .cse0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) v_subst_3))))) [2020-07-10 15:09:28,556 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~end~0.base_28, v_subst_3]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 main_~end~0.base) (not (= .cse1 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse1) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse1)) (= 0 main_~end~0.offset) (not (= .cse1 .cse0)) (not (= .cse0 main_~null~0.base))))) [2020-07-10 15:09:29,429 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:29,429 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 61 [2020-07-10 15:09:29,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:09:29,450 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-10 15:09:29,459 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-10 15:09:29,462 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:29,478 INFO L624 ElimStorePlain]: treesize reduction 36, result has 20.0 percent of original size [2020-07-10 15:09:29,479 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:29,480 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:4 [2020-07-10 15:09:29,486 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:29,486 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~end~0.base_28, v_subst_3]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) 0))) (and (not (= .cse0 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse0)) (= .cse0 main_~end~0.base) (not (= .cse0 .cse1)) (not (= .cse1 main_~null~0.base))))) [2020-07-10 15:09:29,486 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~null~0.base main_~end~0.base)) [2020-07-10 15:09:29,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1341#true} is VALID [2020-07-10 15:09:29,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {1341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1341#true} is VALID [2020-07-10 15:09:29,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2020-07-10 15:09:29,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #136#return; {1341#true} is VALID [2020-07-10 15:09:29,488 INFO L263 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret17 := main(); {1341#true} is VALID [2020-07-10 15:09:29,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {1341#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:29,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:29,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1346#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1379#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base)))} is VALID [2020-07-10 15:09:29,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {1379#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-10 15:09:29,499 INFO L280 TraceCheckUtils]: 9: Hoare triple {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-10 15:09:29,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-10 15:09:29,501 INFO L280 TraceCheckUtils]: 11: Hoare triple {1383#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} goto; {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} goto; {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-10 15:09:29,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {1393#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1418#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} is VALID [2020-07-10 15:09:29,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {1418#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1418#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} is VALID [2020-07-10 15:09:29,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {1418#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1353#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:29,515 INFO L280 TraceCheckUtils]: 22: Hoare triple {1353#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1342#false} is VALID [2020-07-10 15:09:29,515 INFO L280 TraceCheckUtils]: 23: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2020-07-10 15:09:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:29,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:29,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2020-07-10 15:09:29,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922737293] [2020-07-10 15:09:29,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-07-10 15:09:29,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:29,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:09:29,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:29,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:09:29,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:09:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=175, Unknown=1, NotChecked=0, Total=210 [2020-07-10 15:09:29,605 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 15 states. [2020-07-10 15:09:30,687 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2020-07-10 15:09:31,405 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-10 15:09:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,145 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2020-07-10 15:09:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 15:09:33,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-07-10 15:09:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:09:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2020-07-10 15:09:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:09:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2020-07-10 15:09:33,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 135 transitions. [2020-07-10 15:09:33,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:33,462 INFO L225 Difference]: With dead ends: 121 [2020-07-10 15:09:33,462 INFO L226 Difference]: Without dead ends: 119 [2020-07-10 15:09:33,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=171, Invalid=758, Unknown=1, NotChecked=0, Total=930 [2020-07-10 15:09:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-10 15:09:33,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 49. [2020-07-10 15:09:33,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:33,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 49 states. [2020-07-10 15:09:33,581 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 49 states. [2020-07-10 15:09:33,581 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 49 states. [2020-07-10 15:09:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,587 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-10 15:09:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-07-10 15:09:33,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,588 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 119 states. [2020-07-10 15:09:33,589 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 119 states. [2020-07-10 15:09:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,594 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-10 15:09:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-07-10 15:09:33,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:33,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:09:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2020-07-10 15:09:33,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2020-07-10 15:09:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:33,598 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2020-07-10 15:09:33,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:09:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2020-07-10 15:09:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:09:33,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:33,599 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:33,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:33,814 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2050422112, now seen corresponding path program 1 times [2020-07-10 15:09:33,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:33,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116259643] [2020-07-10 15:09:33,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {1915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1900#true} is VALID [2020-07-10 15:09:34,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1900#true} assume true; {1900#true} is VALID [2020-07-10 15:09:34,176 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1900#true} {1900#true} #136#return; {1900#true} is VALID [2020-07-10 15:09:34,176 INFO L263 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:34,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {1915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1900#true} is VALID [2020-07-10 15:09:34,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2020-07-10 15:09:34,177 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #136#return; {1900#true} is VALID [2020-07-10 15:09:34,177 INFO L263 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret17 := main(); {1900#true} is VALID [2020-07-10 15:09:34,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {1900#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1905#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:34,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {1905#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1905#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:09:34,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {1905#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1906#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))} is VALID [2020-07-10 15:09:34,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {1906#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))} assume 0 != #t~nondet5;havoc #t~nondet5;call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-10 15:09:34,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-10 15:09:34,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-10 15:09:34,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} goto; {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1909#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,192 INFO L280 TraceCheckUtils]: 15: Hoare triple {1909#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {1910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} goto; {1910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} is VALID [2020-07-10 15:09:34,194 INFO L280 TraceCheckUtils]: 17: Hoare triple {1910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4) |main_#t~mem9|))} is VALID [2020-07-10 15:09:34,195 INFO L280 TraceCheckUtils]: 18: Hoare triple {1911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4) |main_#t~mem9|))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1912#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4) ~unnamed1~0~RED)))} is VALID [2020-07-10 15:09:34,196 INFO L280 TraceCheckUtils]: 19: Hoare triple {1912#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 4) ~unnamed1~0~RED)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1913#(not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED))} is VALID [2020-07-10 15:09:34,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {1913#(not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1914#(not (= ~unnamed1~0~RED |main_#t~mem9|))} is VALID [2020-07-10 15:09:34,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {1914#(not (= ~unnamed1~0~RED |main_#t~mem9|))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1901#false} is VALID [2020-07-10 15:09:34,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {1901#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1901#false} is VALID [2020-07-10 15:09:34,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2020-07-10 15:09:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:34,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116259643] [2020-07-10 15:09:34,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74492305] [2020-07-10 15:09:34,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 15:09:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:34,356 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-10 15:09:34,356 INFO L384 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 [2020-07-10 15:09:34,357 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,369 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,370 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:09:34,371 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2020-07-10 15:09:34,375 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:34,375 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|, |main_#t~malloc0.base|]. (and (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |v_#valid_27| |main_#t~malloc0.base| 1) main_~list~0.base 1)) (= main_~list~0.base main_~end~0.base)) [2020-07-10 15:09:34,375 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc0.base|]. (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| |main_#t~malloc0.base|))) [2020-07-10 15:09:34,450 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,450 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-10 15:09:34,453 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:09:34,454 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,468 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,477 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:09:34,477 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,489 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,497 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:09:34,497 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,509 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,510 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,510 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2020-07-10 15:09:34,520 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:34,520 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_28|, main_~null~0.offset, |v_#valid_28|, |v_#memory_$Pointer$.base_28|, main_~null~0.base]. (and (<= (select |v_#valid_28| main_~end~0.base) 0) (= (let ((.cse0 (store |v_#memory_$Pointer$.offset_28| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_28| main_~list~0.base) main_~list~0.offset main_~end~0.offset)))) (store .cse0 main_~end~0.base (store (select .cse0 main_~end~0.base) main_~end~0.offset main_~null~0.offset))) |#memory_$Pointer$.offset|) (= 1 (select |v_#valid_28| main_~list~0.base)) (= |#memory_$Pointer$.base| (let ((.cse1 (store |v_#memory_$Pointer$.base_28| main_~list~0.base (store (select |v_#memory_$Pointer$.base_28| main_~list~0.base) main_~list~0.offset main_~end~0.base)))) (store .cse1 main_~end~0.base (store (select .cse1 main_~end~0.base) main_~end~0.offset main_~null~0.base))))) [2020-07-10 15:09:34,521 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) [2020-07-10 15:09:34,569 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|]} [2020-07-10 15:09:34,573 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2020-07-10 15:09:34,574 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,587 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,599 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2020-07-10 15:09:34,601 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,609 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,632 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:34,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 97 [2020-07-10 15:09:34,639 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-07-10 15:09:34,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:09:34,641 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,653 INFO L624 ElimStorePlain]: treesize reduction 40, result has 39.4 percent of original size [2020-07-10 15:09:34,654 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:34,654 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:26 [2020-07-10 15:09:37,273 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:37,274 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, |v_#memory_int_36|, |v_#memory_$Pointer$.offset_29|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_29| main_~list~0.base) main_~list~0.offset)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_29| main_~list~0.base) main_~list~0.offset) 4))) (and (= (store |v_#memory_$Pointer$.offset_29| .cse0 (store (select |v_#memory_$Pointer$.offset_29| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| .cse0 (store (select |v_#memory_$Pointer$.base_29| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (not (= main_~list~0.base .cse0)) (= (store |v_#memory_int_36| .cse0 (store (select |v_#memory_int_36| .cse0) .cse1 ~unnamed1~0~BLACK)) |#memory_int|))) [2020-07-10 15:09:37,274 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (not (= main_~list~0.base .cse0)) (= ~unnamed1~0~BLACK (select (select |#memory_int| .cse0) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))) [2020-07-10 15:09:37,392 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2020-07-10 15:09:37,393 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:37,399 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:37,406 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2020-07-10 15:09:37,407 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:37,411 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:37,413 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:37,413 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:9 [2020-07-10 15:09:37,418 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:37,419 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~end~0.base_31, v_main_~end~0.offset_31, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_31) v_main_~end~0.offset_31)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_31) v_main_~end~0.offset_31))) (and (= main_~end~0.offset .cse0) (not (= v_main_~end~0.base_31 .cse1)) (= .cse1 main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| .cse1) (+ .cse0 4))))) [2020-07-10 15:09:37,419 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) [2020-07-10 15:09:37,453 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-10 15:09:37,459 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:37,460 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:37,461 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:37,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-07-10 15:09:37,463 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:37,464 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))) (and (<= .cse0 |main_#t~mem9|) (= .cse0 ~unnamed1~0~BLACK))) [2020-07-10 15:09:37,464 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= ~unnamed1~0~BLACK |main_#t~mem9|) [2020-07-10 15:09:37,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1900#true} is VALID [2020-07-10 15:09:37,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {1900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1900#true} is VALID [2020-07-10 15:09:37,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2020-07-10 15:09:37,496 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #136#return; {1900#true} is VALID [2020-07-10 15:09:37,497 INFO L263 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret17 := main(); {1900#true} is VALID [2020-07-10 15:09:37,499 INFO L280 TraceCheckUtils]: 5: Hoare triple {1900#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1934#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:37,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {1934#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1934#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-10 15:09:37,501 INFO L280 TraceCheckUtils]: 7: Hoare triple {1934#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1941#(and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-10 15:09:37,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {1941#(and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume 0 != #t~nondet5;havoc #t~nondet5;call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-10 15:09:37,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-10 15:09:37,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-10 15:09:37,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {1945#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} goto; {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} goto; {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,512 INFO L280 TraceCheckUtils]: 18: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-10 15:09:37,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {1955#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1980#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:09:37,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {1980#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1984#(<= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-10 15:09:37,513 INFO L280 TraceCheckUtils]: 21: Hoare triple {1984#(<= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1901#false} is VALID [2020-07-10 15:09:37,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {1901#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1901#false} is VALID [2020-07-10 15:09:37,514 INFO L280 TraceCheckUtils]: 23: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2020-07-10 15:09:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:37,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:37,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2020-07-10 15:09:37,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363426745] [2020-07-10 15:09:37,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-07-10 15:09:37,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:37,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:09:37,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:37,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:09:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:09:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:09:37,586 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 19 states. [2020-07-10 15:09:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:39,789 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2020-07-10 15:09:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:09:39,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-07-10 15:09:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:09:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2020-07-10 15:09:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:09:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2020-07-10 15:09:39,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 76 transitions. [2020-07-10 15:09:39,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:39,921 INFO L225 Difference]: With dead ends: 85 [2020-07-10 15:09:39,921 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 15:09:39,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2020-07-10 15:09:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 15:09:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2020-07-10 15:09:40,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:40,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 58 states. [2020-07-10 15:09:40,082 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 58 states. [2020-07-10 15:09:40,082 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 58 states. [2020-07-10 15:09:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:40,085 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2020-07-10 15:09:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2020-07-10 15:09:40,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:40,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:40,086 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 73 states. [2020-07-10 15:09:40,086 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 73 states. [2020-07-10 15:09:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:40,088 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2020-07-10 15:09:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2020-07-10 15:09:40,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:40,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:40,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:40,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:09:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-07-10 15:09:40,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2020-07-10 15:09:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:40,092 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-07-10 15:09:40,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:09:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-07-10 15:09:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:09:40,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:40,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:40,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:40,307 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1509760762, now seen corresponding path program 1 times [2020-07-10 15:09:40,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:40,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431798666] [2020-07-10 15:09:40,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:40,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:09:40,383 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:09:40,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:09:40,420 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-10 15:09:40,421 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 15:09:40,422 WARN L170 areAnnotationChecker]: L1031-4 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1031-4 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 15:09:40,423 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-10 15:09:40,424 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1035-1 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2020-07-10 15:09:40,425 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-10 15:09:40,426 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-10 15:09:40,427 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2020-07-10 15:09:40,427 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2020-07-10 15:09:40,427 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:09:40,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:09:40 BoogieIcfgContainer [2020-07-10 15:09:40,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:09:40,431 INFO L168 Benchmark]: Toolchain (without parser) took 50050.21 ms. Allocated memory was 135.8 MB in the beginning and 437.3 MB in the end (delta: 301.5 MB). Free memory was 98.9 MB in the beginning and 379.2 MB in the end (delta: -280.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:40,432 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:09:40,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.75 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 98.7 MB in the beginning and 165.7 MB in the end (delta: -67.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:40,433 INFO L168 Benchmark]: Boogie Preprocessor took 84.33 ms. Allocated memory is still 200.3 MB. Free memory was 165.7 MB in the beginning and 162.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:40,433 INFO L168 Benchmark]: RCFGBuilder took 879.31 ms. Allocated memory is still 200.3 MB. Free memory was 162.2 MB in the beginning and 101.4 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:40,433 INFO L168 Benchmark]: TraceAbstraction took 48394.32 ms. Allocated memory was 200.3 MB in the beginning and 437.3 MB in the end (delta: 237.0 MB). Free memory was 101.4 MB in the beginning and 379.2 MB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:09:40,435 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 684.75 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 98.7 MB in the beginning and 165.7 MB in the end (delta: -67.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.33 ms. Allocated memory is still 200.3 MB. Free memory was 165.7 MB in the beginning and 162.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.31 ms. Allocated memory is still 200.3 MB. Free memory was 162.2 MB in the beginning and 101.4 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48394.32 ms. Allocated memory was 200.3 MB in the beginning and 437.3 MB in the end (delta: 237.0 MB). Free memory was 101.4 MB in the beginning and 379.2 MB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, null={-2:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1031] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1039] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-4:0}, null={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 48.2s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 218 SDtfs, 440 SDslu, 975 SDs, 0 SdLazy, 1180 SolverSat, 171 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 145 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 213 ConstructedInterpolants, 19 QuantifiedInterpolants, 87609 SizeOfPredicates, 54 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 1/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...