/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:24:18,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:24:18,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:24:18,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:24:18,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:24:18,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:24:18,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:24:18,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:24:18,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:24:18,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:24:18,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:24:18,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:24:18,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:24:18,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:24:18,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:24:18,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:24:18,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:24:18,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:24:18,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:24:18,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:24:18,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:24:18,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:24:18,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:24:18,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:24:18,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:24:18,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:24:18,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:24:18,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:24:18,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:24:18,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:24:18,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:24:18,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:24:18,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:24:18,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:24:18,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:24:18,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:24:18,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:24:18,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:24:18,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:24:18,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:24:18,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:24:18,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:24:18,319 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:24:18,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:24:18,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:24:18,324 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:24:18,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:24:18,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:24:18,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:24:18,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:24:18,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:24:18,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:24:18,326 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:24:18,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:24:18,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:24:18,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:24:18,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:24:18,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:24:18,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:24:18,329 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:24:18,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:24:18,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:24:18,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:24:18,624 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:24:18,625 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:24:18,626 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-18 00:24:18,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5620ccae/a82c18a0bdaf45ad8a53db212a52e803/FLAG248b0cc24 [2020-07-18 00:24:19,248 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:24:19,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-18 00:24:19,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5620ccae/a82c18a0bdaf45ad8a53db212a52e803/FLAG248b0cc24 [2020-07-18 00:24:19,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5620ccae/a82c18a0bdaf45ad8a53db212a52e803 [2020-07-18 00:24:19,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:24:19,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:24:19,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:19,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:24:19,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:24:19,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:19" (1/1) ... [2020-07-18 00:24:19,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11db17c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:19, skipping insertion in model container [2020-07-18 00:24:19,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:19" (1/1) ... [2020-07-18 00:24:19,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:24:19,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:24:20,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:20,197 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:24:20,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:20,293 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:24:20,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20 WrapperNode [2020-07-18 00:24:20,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:20,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:24:20,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:24:20,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:24:20,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (1/1) ... [2020-07-18 00:24:20,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:24:20,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:24:20,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:24:20,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:24:20,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (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-18 00:24:20,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:24:20,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:24:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:24:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:24:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:24:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:24:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:24:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:24:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:24:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:24:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:24:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:24:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:24:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:24:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:24:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:24:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:24:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:24:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:24:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:24:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:24:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:24:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:24:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:24:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:24:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:24:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:24:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:24:21,142 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:24:21,142 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-18 00:24:21,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:21 BoogieIcfgContainer [2020-07-18 00:24:21,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:24:21,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:24:21,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:24:21,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:24:21,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:24:19" (1/3) ... [2020-07-18 00:24:21,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46de5968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:21, skipping insertion in model container [2020-07-18 00:24:21,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:20" (2/3) ... [2020-07-18 00:24:21,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46de5968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:21, skipping insertion in model container [2020-07-18 00:24:21,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:21" (3/3) ... [2020-07-18 00:24:21,156 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2020-07-18 00:24:21,167 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:24:21,176 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-18 00:24:21,191 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-18 00:24:21,228 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:24:21,228 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:24:21,228 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:24:21,228 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:24:21,229 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:24:21,229 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:24:21,229 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:24:21,229 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:24:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-18 00:24:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-18 00:24:21,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:21,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:21,260 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -159181327, now seen corresponding path program 1 times [2020-07-18 00:24:21,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:21,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1740804606] [2020-07-18 00:24:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:21,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {101#true} is VALID [2020-07-18 00:24:21,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} #valid := #valid[0 := 0]; {101#true} is VALID [2020-07-18 00:24:21,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-18 00:24:21,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 00:24:21,560 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {101#true} {101#true} #196#return; {101#true} is VALID [2020-07-18 00:24:21,563 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:21,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {101#true} is VALID [2020-07-18 00:24:21,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} #valid := #valid[0 := 0]; {101#true} is VALID [2020-07-18 00:24:21,564 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#true} assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-18 00:24:21,565 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 00:24:21,565 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {101#true} {101#true} #196#return; {101#true} is VALID [2020-07-18 00:24:21,565 INFO L263 TraceCheckUtils]: 6: Hoare triple {101#true} call #t~ret17 := main(); {101#true} is VALID [2020-07-18 00:24:21,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {101#true} is VALID [2020-07-18 00:24:21,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {101#true} is VALID [2020-07-18 00:24:21,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {101#true} is VALID [2020-07-18 00:24:21,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {101#true} is VALID [2020-07-18 00:24:21,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {101#true} is VALID [2020-07-18 00:24:21,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {101#true} is VALID [2020-07-18 00:24:21,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {101#true} is VALID [2020-07-18 00:24:21,568 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {101#true} is VALID [2020-07-18 00:24:21,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {101#true} is VALID [2020-07-18 00:24:21,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume !true; {102#false} is VALID [2020-07-18 00:24:21,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {102#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {102#false} is VALID [2020-07-18 00:24:21,571 INFO L280 TraceCheckUtils]: 18: Hoare triple {102#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {102#false} is VALID [2020-07-18 00:24:21,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {102#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {102#false} is VALID [2020-07-18 00:24:21,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-18 00:24:21,576 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-18 00:24:21,580 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:21,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1740804606] [2020-07-18 00:24:21,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:21,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:24:21,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500423110] [2020-07-18 00:24:21,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-18 00:24:21,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:21,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:24:21,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:21,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:24:21,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:24:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:24:21,663 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-18 00:24:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:22,105 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2020-07-18 00:24:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:24:22,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-18 00:24:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:24:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-18 00:24:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:24:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-18 00:24:22,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-18 00:24:22,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:22,374 INFO L225 Difference]: With dead ends: 157 [2020-07-18 00:24:22,374 INFO L226 Difference]: Without dead ends: 74 [2020-07-18 00:24:22,379 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-18 00:24:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-18 00:24:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-18 00:24:22,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:22,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-18 00:24:22,491 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 00:24:22,491 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 00:24:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:22,498 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-18 00:24:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-18 00:24:22,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:22,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:22,500 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 00:24:22,500 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 00:24:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:22,507 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-18 00:24:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-18 00:24:22,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:22,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:22,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:22,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-18 00:24:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-07-18 00:24:22,515 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 21 [2020-07-18 00:24:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:22,515 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-07-18 00:24:22,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:24:22,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2020-07-18 00:24:22,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-18 00:24:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-18 00:24:22,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:22,637 INFO L422 BasicCegarLoop]: trace histogram [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-18 00:24:22,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:24:22,638 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1476818129, now seen corresponding path program 1 times [2020-07-18 00:24:22,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:22,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057149385] [2020-07-18 00:24:22,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:22,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {721#true} is VALID [2020-07-18 00:24:22,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {721#true} #valid := #valid[0 := 0]; {721#true} is VALID [2020-07-18 00:24:22,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {721#true} assume 0 < #StackHeapBarrier; {721#true} is VALID [2020-07-18 00:24:22,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-18 00:24:22,793 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {721#true} {721#true} #196#return; {721#true} is VALID [2020-07-18 00:24:22,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:22,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {721#true} is VALID [2020-07-18 00:24:22,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {721#true} #valid := #valid[0 := 0]; {721#true} is VALID [2020-07-18 00:24:22,795 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#true} assume 0 < #StackHeapBarrier; {721#true} is VALID [2020-07-18 00:24:22,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-18 00:24:22,796 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {721#true} {721#true} #196#return; {721#true} is VALID [2020-07-18 00:24:22,796 INFO L263 TraceCheckUtils]: 6: Hoare triple {721#true} call #t~ret17 := main(); {721#true} is VALID [2020-07-18 00:24:22,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {728#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:24:22,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {728#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-18 00:24:22,799 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-18 00:24:22,800 INFO L280 TraceCheckUtils]: 10: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-18 00:24:22,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {730#(not (= |main_#t~malloc1.base| main_~null~0.base))} is VALID [2020-07-18 00:24:22,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {730#(not (= |main_#t~malloc1.base| main_~null~0.base))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,804 INFO L280 TraceCheckUtils]: 15: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,805 INFO L280 TraceCheckUtils]: 16: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,805 INFO L280 TraceCheckUtils]: 17: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} assume !(0 != #t~nondet2); {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,806 INFO L280 TraceCheckUtils]: 18: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} havoc #t~nondet2; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,807 INFO L280 TraceCheckUtils]: 19: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-18 00:24:22,808 INFO L280 TraceCheckUtils]: 20: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {732#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-18 00:24:22,808 INFO L280 TraceCheckUtils]: 21: Hoare triple {732#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {722#false} is VALID [2020-07-18 00:24:22,809 INFO L280 TraceCheckUtils]: 22: Hoare triple {722#false} assume !false; {722#false} is VALID [2020-07-18 00:24:22,811 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-18 00:24:22,811 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:22,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057149385] [2020-07-18 00:24:22,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:22,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:24:22,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909721348] [2020-07-18 00:24:22,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-18 00:24:22,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:22,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:24:22,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:22,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:24:22,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:24:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:24:22,843 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 8 states. [2020-07-18 00:24:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:23,758 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-18 00:24:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:24:23,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-18 00:24:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2020-07-18 00:24:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2020-07-18 00:24:23,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 97 transitions. [2020-07-18 00:24:23,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:23,891 INFO L225 Difference]: With dead ends: 92 [2020-07-18 00:24:23,892 INFO L226 Difference]: Without dead ends: 90 [2020-07-18 00:24:23,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:24:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-18 00:24:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2020-07-18 00:24:24,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:24,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 72 states. [2020-07-18 00:24:24,094 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 72 states. [2020-07-18 00:24:24,094 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 72 states. [2020-07-18 00:24:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:24,101 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-18 00:24:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-07-18 00:24:24,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:24,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:24,104 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 90 states. [2020-07-18 00:24:24,104 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 90 states. [2020-07-18 00:24:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:24,113 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-18 00:24:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-07-18 00:24:24,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:24,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:24,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:24,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:24:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-07-18 00:24:24,125 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 23 [2020-07-18 00:24:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:24,126 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-07-18 00:24:24,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:24:24,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2020-07-18 00:24:24,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-07-18 00:24:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:24:24,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:24,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:24,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:24:24,239 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1518762392, now seen corresponding path program 1 times [2020-07-18 00:24:24,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:24,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544692524] [2020-07-18 00:24:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:24,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1252#true} is VALID [2020-07-18 00:24:24,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1252#true} #valid := #valid[0 := 0]; {1252#true} is VALID [2020-07-18 00:24:24,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {1252#true} assume 0 < #StackHeapBarrier; {1252#true} is VALID [2020-07-18 00:24:24,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {1252#true} assume true; {1252#true} is VALID [2020-07-18 00:24:24,485 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1252#true} {1252#true} #196#return; {1252#true} is VALID [2020-07-18 00:24:24,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {1252#true} call ULTIMATE.init(); {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:24,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1252#true} is VALID [2020-07-18 00:24:24,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {1252#true} #valid := #valid[0 := 0]; {1252#true} is VALID [2020-07-18 00:24:24,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {1252#true} assume 0 < #StackHeapBarrier; {1252#true} is VALID [2020-07-18 00:24:24,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {1252#true} assume true; {1252#true} is VALID [2020-07-18 00:24:24,488 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1252#true} {1252#true} #196#return; {1252#true} is VALID [2020-07-18 00:24:24,488 INFO L263 TraceCheckUtils]: 6: Hoare triple {1252#true} call #t~ret17 := main(); {1252#true} is VALID [2020-07-18 00:24:24,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1259#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:24:24,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {1252#true} is VALID [2020-07-18 00:24:24,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {1252#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {1252#true} is VALID [2020-07-18 00:24:24,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {1252#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {1252#true} is VALID [2020-07-18 00:24:24,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {1252#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {1260#(= 0 |main_#t~malloc1.offset|)} is VALID [2020-07-18 00:24:24,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {1260#(= 0 |main_#t~malloc1.offset|)} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {1261#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:24,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {1261#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {1261#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:24,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {1261#(= 0 main_~list~0.offset)} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {1262#(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-18 00:24:24,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#(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 := ~list~0.base, ~list~0.offset; {1262#(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-18 00:24:24,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {1262#(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; {1262#(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-18 00:24:24,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {1262#(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); {1262#(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-18 00:24:24,497 INFO L280 TraceCheckUtils]: 18: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {1262#(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-18 00:24:24,497 INFO L280 TraceCheckUtils]: 19: Hoare triple {1262#(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; {1262#(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-18 00:24:24,498 INFO L280 TraceCheckUtils]: 20: Hoare triple {1262#(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 := ~list~0.base, ~list~0.offset; {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:24,499 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#(= (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); {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:24,500 INFO L280 TraceCheckUtils]: 22: Hoare triple {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:24,501 INFO L280 TraceCheckUtils]: 23: Hoare triple {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {1264#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-18 00:24:24,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {1264#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {1253#false} is VALID [2020-07-18 00:24:24,501 INFO L280 TraceCheckUtils]: 25: Hoare triple {1253#false} havoc #t~mem8; {1253#false} is VALID [2020-07-18 00:24:24,502 INFO L280 TraceCheckUtils]: 26: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2020-07-18 00:24:24,504 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-18 00:24:24,504 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:24,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544692524] [2020-07-18 00:24:24,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:24,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:24:24,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62033320] [2020-07-18 00:24:24,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-18 00:24:24,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:24,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:24:24,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:24,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:24:24,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:24:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:24:24,537 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 9 states. [2020-07-18 00:24:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:25,872 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2020-07-18 00:24:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:24:25,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-18 00:24:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:24:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2020-07-18 00:24:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:24:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2020-07-18 00:24:25,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 126 transitions. [2020-07-18 00:24:26,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:26,060 INFO L225 Difference]: With dead ends: 120 [2020-07-18 00:24:26,060 INFO L226 Difference]: Without dead ends: 117 [2020-07-18 00:24:26,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:24:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-18 00:24:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-07-18 00:24:26,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:26,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 81 states. [2020-07-18 00:24:26,380 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 81 states. [2020-07-18 00:24:26,381 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 81 states. [2020-07-18 00:24:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:26,388 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-18 00:24:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-18 00:24:26,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:26,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:26,390 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 117 states. [2020-07-18 00:24:26,390 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 117 states. [2020-07-18 00:24:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:26,395 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-18 00:24:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-18 00:24:26,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:26,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:26,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:26,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:24:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2020-07-18 00:24:26,399 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 27 [2020-07-18 00:24:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:26,400 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2020-07-18 00:24:26,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:24:26,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 85 transitions. [2020-07-18 00:24:26,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2020-07-18 00:24:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:24:26,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:26,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:26,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:24:26,554 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2047332937, now seen corresponding path program 1 times [2020-07-18 00:24:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:26,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730697436] [2020-07-18 00:24:26,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:26,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1918#true} is VALID [2020-07-18 00:24:26,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {1918#true} #valid := #valid[0 := 0]; {1918#true} is VALID [2020-07-18 00:24:26,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {1918#true} assume 0 < #StackHeapBarrier; {1918#true} is VALID [2020-07-18 00:24:26,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {1918#true} assume true; {1918#true} is VALID [2020-07-18 00:24:26,800 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1918#true} {1918#true} #196#return; {1918#true} is VALID [2020-07-18 00:24:26,801 INFO L263 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:26,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1918#true} is VALID [2020-07-18 00:24:26,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {1918#true} #valid := #valid[0 := 0]; {1918#true} is VALID [2020-07-18 00:24:26,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {1918#true} assume 0 < #StackHeapBarrier; {1918#true} is VALID [2020-07-18 00:24:26,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {1918#true} assume true; {1918#true} is VALID [2020-07-18 00:24:26,803 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1918#true} {1918#true} #196#return; {1918#true} is VALID [2020-07-18 00:24:26,803 INFO L263 TraceCheckUtils]: 6: Hoare triple {1918#true} call #t~ret17 := main(); {1918#true} is VALID [2020-07-18 00:24:26,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {1918#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1918#true} is VALID [2020-07-18 00:24:26,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {1918#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {1918#true} is VALID [2020-07-18 00:24:26,804 INFO L280 TraceCheckUtils]: 9: Hoare triple {1918#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {1918#true} is VALID [2020-07-18 00:24:26,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {1918#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {1918#true} is VALID [2020-07-18 00:24:26,804 INFO L280 TraceCheckUtils]: 11: Hoare triple {1918#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {1918#true} is VALID [2020-07-18 00:24:26,805 INFO L280 TraceCheckUtils]: 12: Hoare triple {1918#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {1918#true} is VALID [2020-07-18 00:24:26,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {1918#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {1918#true} is VALID [2020-07-18 00:24:26,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {1918#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {1918#true} is VALID [2020-07-18 00:24:26,806 INFO L280 TraceCheckUtils]: 15: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1918#true} is VALID [2020-07-18 00:24:26,807 INFO L280 TraceCheckUtils]: 16: Hoare triple {1918#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1918#true} is VALID [2020-07-18 00:24:26,807 INFO L280 TraceCheckUtils]: 17: Hoare triple {1918#true} assume !(0 != #t~nondet2); {1918#true} is VALID [2020-07-18 00:24:26,807 INFO L280 TraceCheckUtils]: 18: Hoare triple {1918#true} havoc #t~nondet2; {1918#true} is VALID [2020-07-18 00:24:26,807 INFO L280 TraceCheckUtils]: 19: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {1918#true} is VALID [2020-07-18 00:24:26,808 INFO L280 TraceCheckUtils]: 20: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1918#true} is VALID [2020-07-18 00:24:26,808 INFO L280 TraceCheckUtils]: 21: Hoare triple {1918#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1918#true} is VALID [2020-07-18 00:24:26,809 INFO L280 TraceCheckUtils]: 22: Hoare triple {1918#true} goto; {1918#true} is VALID [2020-07-18 00:24:26,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {1918#true} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {1925#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} is VALID [2020-07-18 00:24:26,810 INFO L280 TraceCheckUtils]: 24: Hoare triple {1925#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} assume !!(~unnamed1~0~BLACK == #t~mem8); {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:26,811 INFO L280 TraceCheckUtils]: 25: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} havoc #t~mem8; {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:26,812 INFO L280 TraceCheckUtils]: 26: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:26,812 INFO L280 TraceCheckUtils]: 27: Hoare triple {1926#(= (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); {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:26,813 INFO L280 TraceCheckUtils]: 28: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {1927#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-18 00:24:26,814 INFO L280 TraceCheckUtils]: 29: Hoare triple {1927#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9; {1919#false} is VALID [2020-07-18 00:24:26,814 INFO L280 TraceCheckUtils]: 30: Hoare triple {1919#false} havoc #t~mem9; {1919#false} is VALID [2020-07-18 00:24:26,814 INFO L280 TraceCheckUtils]: 31: Hoare triple {1919#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 {1919#false} is VALID [2020-07-18 00:24:26,815 INFO L280 TraceCheckUtils]: 32: Hoare triple {1919#false} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {1919#false} is VALID [2020-07-18 00:24:26,815 INFO L280 TraceCheckUtils]: 33: Hoare triple {1919#false} havoc #t~mem10.base, #t~mem10.offset; {1919#false} is VALID [2020-07-18 00:24:26,819 INFO L280 TraceCheckUtils]: 34: Hoare triple {1919#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1919#false} is VALID [2020-07-18 00:24:26,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2020-07-18 00:24:26,821 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-18 00:24:26,845 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:26,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730697436] [2020-07-18 00:24:26,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:26,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:24:26,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130107145] [2020-07-18 00:24:26,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-18 00:24:26,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:26,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:24:26,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:26,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:24:26,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:24:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:24:26,888 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2020-07-18 00:24:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:27,773 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-07-18 00:24:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:24:27,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-18 00:24:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2020-07-18 00:24:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2020-07-18 00:24:27,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2020-07-18 00:24:27,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:27,896 INFO L225 Difference]: With dead ends: 114 [2020-07-18 00:24:27,896 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 00:24:27,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:24:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 00:24:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2020-07-18 00:24:28,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:28,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 84 states. [2020-07-18 00:24:28,234 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 84 states. [2020-07-18 00:24:28,234 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 84 states. [2020-07-18 00:24:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:28,237 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2020-07-18 00:24:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2020-07-18 00:24:28,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:28,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:28,238 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 92 states. [2020-07-18 00:24:28,238 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 92 states. [2020-07-18 00:24:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:28,241 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2020-07-18 00:24:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2020-07-18 00:24:28,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:28,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:28,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:28,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-18 00:24:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2020-07-18 00:24:28,245 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 36 [2020-07-18 00:24:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:28,246 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2020-07-18 00:24:28,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:24:28,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2020-07-18 00:24:28,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-18 00:24:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 00:24:28,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:28,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:28,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:24:28,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1237644091, now seen corresponding path program 1 times [2020-07-18 00:24:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:28,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078959649] [2020-07-18 00:24:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:29,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2515#true} is VALID [2020-07-18 00:24:29,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {2515#true} #valid := #valid[0 := 0]; {2515#true} is VALID [2020-07-18 00:24:29,091 INFO L280 TraceCheckUtils]: 2: Hoare triple {2515#true} assume 0 < #StackHeapBarrier; {2515#true} is VALID [2020-07-18 00:24:29,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {2515#true} assume true; {2515#true} is VALID [2020-07-18 00:24:29,091 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2515#true} {2515#true} #196#return; {2515#true} is VALID [2020-07-18 00:24:29,094 INFO L263 TraceCheckUtils]: 0: Hoare triple {2515#true} call ULTIMATE.init(); {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:29,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2515#true} is VALID [2020-07-18 00:24:29,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {2515#true} #valid := #valid[0 := 0]; {2515#true} is VALID [2020-07-18 00:24:29,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {2515#true} assume 0 < #StackHeapBarrier; {2515#true} is VALID [2020-07-18 00:24:29,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {2515#true} assume true; {2515#true} is VALID [2020-07-18 00:24:29,095 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2515#true} {2515#true} #196#return; {2515#true} is VALID [2020-07-18 00:24:29,095 INFO L263 TraceCheckUtils]: 6: Hoare triple {2515#true} call #t~ret17 := main(); {2515#true} is VALID [2020-07-18 00:24:29,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {2515#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2522#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:24:29,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {2522#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {2515#true} is VALID [2020-07-18 00:24:29,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {2515#true} is VALID [2020-07-18 00:24:29,097 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {2515#true} is VALID [2020-07-18 00:24:29,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {2523#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-18 00:24:29,100 INFO L280 TraceCheckUtils]: 12: Hoare triple {2523#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:29,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:29,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {2525#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,102 INFO L280 TraceCheckUtils]: 15: Hoare triple {2525#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2526#(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-18 00:24:29,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {2526#(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; {2526#(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-18 00:24:29,104 INFO L280 TraceCheckUtils]: 17: Hoare triple {2526#(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); {2526#(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-18 00:24:29,105 INFO L280 TraceCheckUtils]: 18: Hoare triple {2526#(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)))} havoc #t~nondet2; {2526#(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-18 00:24:29,106 INFO L280 TraceCheckUtils]: 19: Hoare triple {2526#(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)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {2527#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-18 00:24:29,107 INFO L280 TraceCheckUtils]: 20: Hoare triple {2527#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {2528#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-18 00:24:29,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {2528#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {2529#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {2529#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {2530#(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-18 00:24:29,110 INFO L280 TraceCheckUtils]: 23: Hoare triple {2530#(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))))} havoc #t~mem4.base, #t~mem4.offset; {2530#(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-18 00:24:29,111 INFO L280 TraceCheckUtils]: 24: Hoare triple {2530#(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))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,112 INFO L280 TraceCheckUtils]: 26: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,113 INFO L280 TraceCheckUtils]: 27: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:29,114 INFO L280 TraceCheckUtils]: 28: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {2532#(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-18 00:24:29,115 INFO L280 TraceCheckUtils]: 29: Hoare triple {2532#(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; {2532#(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-18 00:24:29,116 INFO L280 TraceCheckUtils]: 30: Hoare triple {2532#(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); {2532#(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-18 00:24:29,116 INFO L280 TraceCheckUtils]: 31: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {2532#(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-18 00:24:29,117 INFO L280 TraceCheckUtils]: 32: Hoare triple {2532#(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; {2532#(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-18 00:24:29,118 INFO L280 TraceCheckUtils]: 33: Hoare triple {2532#(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 := ~list~0.base, ~list~0.offset; {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:29,119 INFO L280 TraceCheckUtils]: 34: Hoare triple {2533#(= (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); {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:29,119 INFO L280 TraceCheckUtils]: 35: Hoare triple {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:29,120 INFO L280 TraceCheckUtils]: 36: Hoare triple {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {2534#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-18 00:24:29,120 INFO L280 TraceCheckUtils]: 37: Hoare triple {2534#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {2516#false} is VALID [2020-07-18 00:24:29,121 INFO L280 TraceCheckUtils]: 38: Hoare triple {2516#false} havoc #t~mem8; {2516#false} is VALID [2020-07-18 00:24:29,121 INFO L280 TraceCheckUtils]: 39: Hoare triple {2516#false} assume !false; {2516#false} is VALID [2020-07-18 00:24:29,128 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-18 00:24:29,129 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:29,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078959649] [2020-07-18 00:24:29,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:29,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 00:24:29,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654793403] [2020-07-18 00:24:29,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-18 00:24:29,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:29,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 00:24:29,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:29,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 00:24:29,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 00:24:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:24:29,182 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 16 states. [2020-07-18 00:24:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:32,566 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2020-07-18 00:24:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 00:24:32,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-18 00:24:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:24:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2020-07-18 00:24:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:24:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2020-07-18 00:24:32,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 157 transitions. [2020-07-18 00:24:32,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:32,821 INFO L225 Difference]: With dead ends: 155 [2020-07-18 00:24:32,822 INFO L226 Difference]: Without dead ends: 152 [2020-07-18 00:24:32,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2020-07-18 00:24:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-18 00:24:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2020-07-18 00:24:33,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:33,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 97 states. [2020-07-18 00:24:33,301 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 97 states. [2020-07-18 00:24:33,301 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 97 states. [2020-07-18 00:24:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:33,306 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-18 00:24:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-18 00:24:33,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:33,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:33,307 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 152 states. [2020-07-18 00:24:33,307 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 152 states. [2020-07-18 00:24:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:33,312 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-18 00:24:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-18 00:24:33,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:33,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:33,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:33,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 00:24:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2020-07-18 00:24:33,317 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 40 [2020-07-18 00:24:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:33,318 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2020-07-18 00:24:33,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 00:24:33,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 103 transitions. [2020-07-18 00:24:33,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2020-07-18 00:24:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:24:33,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:33,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:33,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:24:33,569 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1411163060, now seen corresponding path program 1 times [2020-07-18 00:24:33,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:33,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694830220] [2020-07-18 00:24:33,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:33,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3374#true} is VALID [2020-07-18 00:24:33,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {3374#true} #valid := #valid[0 := 0]; {3374#true} is VALID [2020-07-18 00:24:33,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {3374#true} assume 0 < #StackHeapBarrier; {3374#true} is VALID [2020-07-18 00:24:33,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {3374#true} assume true; {3374#true} is VALID [2020-07-18 00:24:33,736 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3374#true} {3374#true} #196#return; {3374#true} is VALID [2020-07-18 00:24:33,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {3374#true} call ULTIMATE.init(); {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:33,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3374#true} is VALID [2020-07-18 00:24:33,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {3374#true} #valid := #valid[0 := 0]; {3374#true} is VALID [2020-07-18 00:24:33,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {3374#true} assume 0 < #StackHeapBarrier; {3374#true} is VALID [2020-07-18 00:24:33,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {3374#true} assume true; {3374#true} is VALID [2020-07-18 00:24:33,738 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3374#true} {3374#true} #196#return; {3374#true} is VALID [2020-07-18 00:24:33,738 INFO L263 TraceCheckUtils]: 6: Hoare triple {3374#true} call #t~ret17 := main(); {3374#true} is VALID [2020-07-18 00:24:33,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {3374#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {3374#true} is VALID [2020-07-18 00:24:33,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {3374#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {3374#true} is VALID [2020-07-18 00:24:33,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {3374#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {3374#true} is VALID [2020-07-18 00:24:33,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {3374#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {3374#true} is VALID [2020-07-18 00:24:33,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {3374#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {3374#true} is VALID [2020-07-18 00:24:33,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {3374#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {3374#true} is VALID [2020-07-18 00:24:33,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {3374#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,743 INFO L280 TraceCheckUtils]: 14: Hoare triple {3381#(and (= (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))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {3381#(and (= (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))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,745 INFO L280 TraceCheckUtils]: 16: Hoare triple {3381#(and (= (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))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {3381#(and (= (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))} assume !(0 != #t~nondet2); {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,747 INFO L280 TraceCheckUtils]: 18: Hoare triple {3381#(and (= (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))} havoc #t~nondet2; {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,748 INFO L280 TraceCheckUtils]: 19: Hoare triple {3381#(and (= (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))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {3381#(and (= (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))} is VALID [2020-07-18 00:24:33,748 INFO L280 TraceCheckUtils]: 20: Hoare triple {3381#(and (= (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))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3382#(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))} is VALID [2020-07-18 00:24:33,749 INFO L280 TraceCheckUtils]: 21: Hoare triple {3382#(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))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3382#(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))} is VALID [2020-07-18 00:24:33,749 INFO L280 TraceCheckUtils]: 22: Hoare triple {3382#(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))} goto; {3382#(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))} is VALID [2020-07-18 00:24:33,750 INFO L280 TraceCheckUtils]: 23: Hoare triple {3382#(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))} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {3382#(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))} is VALID [2020-07-18 00:24:33,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {3382#(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))} assume !!(~unnamed1~0~BLACK == #t~mem8); {3382#(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))} is VALID [2020-07-18 00:24:33,751 INFO L280 TraceCheckUtils]: 25: Hoare triple {3382#(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))} havoc #t~mem8; {3382#(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))} is VALID [2020-07-18 00:24:33,756 INFO L280 TraceCheckUtils]: 26: Hoare triple {3382#(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))} goto; {3382#(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))} is VALID [2020-07-18 00:24:33,756 INFO L280 TraceCheckUtils]: 27: Hoare triple {3382#(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))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3382#(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))} is VALID [2020-07-18 00:24:33,757 INFO L280 TraceCheckUtils]: 28: Hoare triple {3382#(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))} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {3382#(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))} is VALID [2020-07-18 00:24:33,758 INFO L280 TraceCheckUtils]: 29: Hoare triple {3382#(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))} assume !(~unnamed1~0~RED == #t~mem9); {3382#(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))} is VALID [2020-07-18 00:24:33,758 INFO L280 TraceCheckUtils]: 30: Hoare triple {3382#(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))} havoc #t~mem9; {3382#(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))} is VALID [2020-07-18 00:24:33,759 INFO L280 TraceCheckUtils]: 31: Hoare triple {3382#(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))} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1035-4 {3383#(and (= |main_#t~mem12.offset| main_~null~0.offset) (= |main_#t~mem12.base| main_~null~0.base))} is VALID [2020-07-18 00:24:33,760 INFO L280 TraceCheckUtils]: 32: Hoare triple {3383#(and (= |main_#t~mem12.offset| main_~null~0.offset) (= |main_#t~mem12.base| main_~null~0.base))} ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-18 00:24:33,761 INFO L280 TraceCheckUtils]: 33: Hoare triple {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} havoc #t~mem12.base, #t~mem12.offset; {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-18 00:24:33,761 INFO L280 TraceCheckUtils]: 34: Hoare triple {3384#(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); {3375#false} is VALID [2020-07-18 00:24:33,762 INFO L280 TraceCheckUtils]: 35: Hoare triple {3375#false} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {3375#false} is VALID [2020-07-18 00:24:33,762 INFO L280 TraceCheckUtils]: 36: Hoare triple {3375#false} assume ~unnamed1~0~RED == #t~mem9; {3375#false} is VALID [2020-07-18 00:24:33,762 INFO L280 TraceCheckUtils]: 37: Hoare triple {3375#false} havoc #t~mem9; {3375#false} is VALID [2020-07-18 00:24:33,762 INFO L280 TraceCheckUtils]: 38: Hoare triple {3375#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 {3375#false} is VALID [2020-07-18 00:24:33,763 INFO L280 TraceCheckUtils]: 39: Hoare triple {3375#false} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {3375#false} is VALID [2020-07-18 00:24:33,763 INFO L280 TraceCheckUtils]: 40: Hoare triple {3375#false} havoc #t~mem10.base, #t~mem10.offset; {3375#false} is VALID [2020-07-18 00:24:33,763 INFO L280 TraceCheckUtils]: 41: Hoare triple {3375#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3375#false} is VALID [2020-07-18 00:24:33,763 INFO L280 TraceCheckUtils]: 42: Hoare triple {3375#false} assume !false; {3375#false} is VALID [2020-07-18 00:24:33,768 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-18 00:24:33,772 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:33,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694830220] [2020-07-18 00:24:33,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:33,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:24:33,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554155846] [2020-07-18 00:24:33,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-18 00:24:33,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:33,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:24:33,820 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-18 00:24:33,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:24:33,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:24:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:24:33,822 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 7 states. [2020-07-18 00:24:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:35,177 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2020-07-18 00:24:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:24:35,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-18 00:24:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2020-07-18 00:24:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2020-07-18 00:24:35,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2020-07-18 00:24:35,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:35,319 INFO L225 Difference]: With dead ends: 136 [2020-07-18 00:24:35,319 INFO L226 Difference]: Without dead ends: 97 [2020-07-18 00:24:35,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:24:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-18 00:24:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-18 00:24:35,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:35,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-18 00:24:35,800 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:24:35,800 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:24:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:35,803 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-07-18 00:24:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-18 00:24:35,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:35,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:35,804 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:24:35,804 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:24:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:35,806 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-07-18 00:24:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-18 00:24:35,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:35,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:35,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:35,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 00:24:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2020-07-18 00:24:35,809 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2020-07-18 00:24:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:35,810 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2020-07-18 00:24:35,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:24:35,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 102 transitions. [2020-07-18 00:24:36,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-18 00:24:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:24:36,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:36,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:36,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:24:36,042 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1215747511, now seen corresponding path program 1 times [2020-07-18 00:24:36,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:36,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016731857] [2020-07-18 00:24:36,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:36,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4056#true} is VALID [2020-07-18 00:24:36,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {4056#true} #valid := #valid[0 := 0]; {4056#true} is VALID [2020-07-18 00:24:36,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {4056#true} assume 0 < #StackHeapBarrier; {4056#true} is VALID [2020-07-18 00:24:36,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {4056#true} assume true; {4056#true} is VALID [2020-07-18 00:24:36,850 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4056#true} {4056#true} #196#return; {4056#true} is VALID [2020-07-18 00:24:36,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {4056#true} call ULTIMATE.init(); {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:36,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4056#true} is VALID [2020-07-18 00:24:36,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {4056#true} #valid := #valid[0 := 0]; {4056#true} is VALID [2020-07-18 00:24:36,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {4056#true} assume 0 < #StackHeapBarrier; {4056#true} is VALID [2020-07-18 00:24:36,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {4056#true} assume true; {4056#true} is VALID [2020-07-18 00:24:36,854 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4056#true} {4056#true} #196#return; {4056#true} is VALID [2020-07-18 00:24:36,854 INFO L263 TraceCheckUtils]: 6: Hoare triple {4056#true} call #t~ret17 := main(); {4056#true} is VALID [2020-07-18 00:24:36,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {4056#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4063#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:24:36,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {4063#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {4056#true} is VALID [2020-07-18 00:24:36,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {4056#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {4056#true} is VALID [2020-07-18 00:24:36,857 INFO L280 TraceCheckUtils]: 10: Hoare triple {4056#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {4056#true} is VALID [2020-07-18 00:24:36,863 INFO L280 TraceCheckUtils]: 11: Hoare triple {4056#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {4064#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-18 00:24:36,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {4064#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {4065#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:36,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {4065#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {4065#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:36,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {4065#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {4066#(and (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:36,867 INFO L280 TraceCheckUtils]: 15: Hoare triple {4066#(and (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4067#(and (= 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-18 00:24:36,868 INFO L280 TraceCheckUtils]: 16: Hoare triple {4067#(and (= 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; {4067#(and (= 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-18 00:24:36,868 INFO L280 TraceCheckUtils]: 17: Hoare triple {4067#(and (= 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); {4067#(and (= 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-18 00:24:36,869 INFO L280 TraceCheckUtils]: 18: Hoare triple {4067#(and (= 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)))} havoc #t~nondet2; {4067#(and (= 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-18 00:24:36,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {4067#(and (= 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)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4068#(and (not (= |main_#t~malloc3.base| main_~end~0.base)) (= 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-18 00:24:36,872 INFO L280 TraceCheckUtils]: 20: Hoare triple {4068#(and (not (= |main_#t~malloc3.base| main_~end~0.base)) (= 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)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4069#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= 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-18 00:24:36,873 INFO L280 TraceCheckUtils]: 21: Hoare triple {4069#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= 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)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4070#(and (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:36,874 INFO L280 TraceCheckUtils]: 22: Hoare triple {4070#(and (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4071#(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))))} is VALID [2020-07-18 00:24:36,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {4071#(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))))} havoc #t~mem4.base, #t~mem4.offset; {4071#(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))))} is VALID [2020-07-18 00:24:36,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {4071#(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))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4071#(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))))} is VALID [2020-07-18 00:24:36,877 INFO L280 TraceCheckUtils]: 25: Hoare triple {4071#(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))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4071#(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))))} is VALID [2020-07-18 00:24:36,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {4071#(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))))} assume !(0 != #t~nondet5); {4071#(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))))} is VALID [2020-07-18 00:24:36,878 INFO L280 TraceCheckUtils]: 27: Hoare triple {4071#(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))))} havoc #t~nondet5; {4071#(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))))} is VALID [2020-07-18 00:24:36,881 INFO L280 TraceCheckUtils]: 28: Hoare triple {4071#(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))))} SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1018 {4071#(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))))} is VALID [2020-07-18 00:24:36,884 INFO L280 TraceCheckUtils]: 29: Hoare triple {4071#(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))))} SUMMARY for call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8); srcloc: L1018-1 {4072#(and (not (= main_~list~0.base main_~end~0.base)) (= ~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)))} is VALID [2020-07-18 00:24:36,892 INFO L280 TraceCheckUtils]: 30: Hoare triple {4072#(and (not (= main_~list~0.base main_~end~0.base)) (= ~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)))} SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1019 {4073#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} is VALID [2020-07-18 00:24:36,894 INFO L280 TraceCheckUtils]: 31: Hoare triple {4073#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1019-1 {4074#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem7.base| main_~list~0.base)))} is VALID [2020-07-18 00:24:36,895 INFO L280 TraceCheckUtils]: 32: Hoare triple {4074#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem7.base| main_~list~0.base)))} ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; {4075#(and (not (= 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-18 00:24:36,895 INFO L280 TraceCheckUtils]: 33: Hoare triple {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem7.base, #t~mem7.offset; {4075#(and (not (= 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-18 00:24:36,897 INFO L280 TraceCheckUtils]: 34: Hoare triple {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1021 {4076#(= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,898 INFO L280 TraceCheckUtils]: 35: Hoare triple {4076#(= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1021-1 {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,898 INFO L280 TraceCheckUtils]: 36: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,899 INFO L280 TraceCheckUtils]: 37: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume !(0 != #t~nondet2); {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,900 INFO L280 TraceCheckUtils]: 38: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~nondet2; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,900 INFO L280 TraceCheckUtils]: 39: Hoare triple {4077#(= ~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; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:24:36,901 INFO L280 TraceCheckUtils]: 40: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:36,901 INFO L280 TraceCheckUtils]: 41: Hoare triple {4078#(= (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); {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:36,902 INFO L280 TraceCheckUtils]: 42: Hoare triple {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:36,902 INFO L280 TraceCheckUtils]: 43: Hoare triple {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {4079#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-18 00:24:36,903 INFO L280 TraceCheckUtils]: 44: Hoare triple {4079#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {4057#false} is VALID [2020-07-18 00:24:36,903 INFO L280 TraceCheckUtils]: 45: Hoare triple {4057#false} havoc #t~mem8; {4057#false} is VALID [2020-07-18 00:24:36,903 INFO L280 TraceCheckUtils]: 46: Hoare triple {4057#false} assume !false; {4057#false} is VALID [2020-07-18 00:24:36,911 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-18 00:24:36,912 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:36,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016731857] [2020-07-18 00:24:36,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:36,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-18 00:24:36,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129185569] [2020-07-18 00:24:36,913 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2020-07-18 00:24:36,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:36,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 00:24:36,967 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-18 00:24:36,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 00:24:36,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 00:24:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:24:36,968 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 20 states. [2020-07-18 00:24:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:40,898 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2020-07-18 00:24:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-18 00:24:40,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2020-07-18 00:24:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:24:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 165 transitions. [2020-07-18 00:24:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:24:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 165 transitions. [2020-07-18 00:24:40,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 165 transitions. [2020-07-18 00:24:41,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:41,149 INFO L225 Difference]: With dead ends: 163 [2020-07-18 00:24:41,149 INFO L226 Difference]: Without dead ends: 160 [2020-07-18 00:24:41,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2020-07-18 00:24:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-18 00:24:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2020-07-18 00:24:41,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:41,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 106 states. [2020-07-18 00:24:41,737 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 106 states. [2020-07-18 00:24:41,737 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 106 states. [2020-07-18 00:24:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:41,743 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2020-07-18 00:24:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2020-07-18 00:24:41,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:41,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:41,745 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 160 states. [2020-07-18 00:24:41,745 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 160 states. [2020-07-18 00:24:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:41,751 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2020-07-18 00:24:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2020-07-18 00:24:41,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:41,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:41,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:41,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-18 00:24:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2020-07-18 00:24:41,756 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 47 [2020-07-18 00:24:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:41,756 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2020-07-18 00:24:41,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 00:24:41,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 106 states and 111 transitions. [2020-07-18 00:24:42,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-18 00:24:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:24:42,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:42,035 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:42,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:24:42,035 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 231328440, now seen corresponding path program 2 times [2020-07-18 00:24:42,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:42,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799667888] [2020-07-18 00:24:42,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:42,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4979#true} is VALID [2020-07-18 00:24:42,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {4979#true} #valid := #valid[0 := 0]; {4979#true} is VALID [2020-07-18 00:24:42,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {4979#true} assume 0 < #StackHeapBarrier; {4979#true} is VALID [2020-07-18 00:24:42,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {4979#true} assume true; {4979#true} is VALID [2020-07-18 00:24:42,855 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4979#true} {4979#true} #196#return; {4979#true} is VALID [2020-07-18 00:24:42,856 INFO L263 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:42,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4979#true} is VALID [2020-07-18 00:24:42,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {4979#true} #valid := #valid[0 := 0]; {4979#true} is VALID [2020-07-18 00:24:42,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {4979#true} assume 0 < #StackHeapBarrier; {4979#true} is VALID [2020-07-18 00:24:42,857 INFO L280 TraceCheckUtils]: 4: Hoare triple {4979#true} assume true; {4979#true} is VALID [2020-07-18 00:24:42,857 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4979#true} {4979#true} #196#return; {4979#true} is VALID [2020-07-18 00:24:42,857 INFO L263 TraceCheckUtils]: 6: Hoare triple {4979#true} call #t~ret17 := main(); {4979#true} is VALID [2020-07-18 00:24:42,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {4979#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4986#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:24:42,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {4986#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {4979#true} is VALID [2020-07-18 00:24:42,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {4979#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {4979#true} is VALID [2020-07-18 00:24:42,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {4979#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {4979#true} is VALID [2020-07-18 00:24:42,860 INFO L280 TraceCheckUtils]: 11: Hoare triple {4979#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {4987#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-18 00:24:42,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {4987#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:42,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:42,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {4989#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {4989#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4990#(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-18 00:24:42,865 INFO L280 TraceCheckUtils]: 16: Hoare triple {4990#(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; {4990#(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-18 00:24:42,872 INFO L280 TraceCheckUtils]: 17: Hoare triple {4990#(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); {4990#(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-18 00:24:42,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {4990#(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)))} havoc #t~nondet2; {4990#(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-18 00:24:42,877 INFO L280 TraceCheckUtils]: 19: Hoare triple {4990#(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)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4991#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= 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-18 00:24:42,878 INFO L280 TraceCheckUtils]: 20: Hoare triple {4991#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= 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)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4992#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= 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-18 00:24:42,879 INFO L280 TraceCheckUtils]: 21: Hoare triple {4992#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= 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)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4993#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,880 INFO L280 TraceCheckUtils]: 22: Hoare triple {4993#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,881 INFO L280 TraceCheckUtils]: 23: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,883 INFO L280 TraceCheckUtils]: 25: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,884 INFO L280 TraceCheckUtils]: 26: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,885 INFO L280 TraceCheckUtils]: 27: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~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; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != #t~nondet2); {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,890 INFO L280 TraceCheckUtils]: 31: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,891 INFO L280 TraceCheckUtils]: 32: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4995#(and (not (= main_~list~0.base main_~end~0.base)) (not (= |main_#t~malloc3.base| main_~list~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-18 00:24:42,893 INFO L280 TraceCheckUtils]: 33: Hoare triple {4995#(and (not (= main_~list~0.base main_~end~0.base)) (not (= |main_#t~malloc3.base| main_~list~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4996#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} is VALID [2020-07-18 00:24:42,894 INFO L280 TraceCheckUtils]: 34: Hoare triple {4996#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4997#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,895 INFO L280 TraceCheckUtils]: 35: Hoare triple {4997#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4998#(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-18 00:24:42,896 INFO L280 TraceCheckUtils]: 36: Hoare triple {4998#(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))))} havoc #t~mem4.base, #t~mem4.offset; {4998#(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-18 00:24:42,897 INFO L280 TraceCheckUtils]: 37: Hoare triple {4998#(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))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,898 INFO L280 TraceCheckUtils]: 38: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,899 INFO L280 TraceCheckUtils]: 39: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,900 INFO L280 TraceCheckUtils]: 40: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:42,900 INFO L280 TraceCheckUtils]: 41: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {5000#(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-18 00:24:42,901 INFO L280 TraceCheckUtils]: 42: Hoare triple {5000#(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; {5000#(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-18 00:24:42,902 INFO L280 TraceCheckUtils]: 43: Hoare triple {5000#(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); {5000#(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-18 00:24:42,902 INFO L280 TraceCheckUtils]: 44: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {5000#(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-18 00:24:42,903 INFO L280 TraceCheckUtils]: 45: Hoare triple {5000#(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; {5000#(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-18 00:24:42,903 INFO L280 TraceCheckUtils]: 46: Hoare triple {5000#(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 := ~list~0.base, ~list~0.offset; {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:42,904 INFO L280 TraceCheckUtils]: 47: Hoare triple {5001#(= (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); {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:42,904 INFO L280 TraceCheckUtils]: 48: Hoare triple {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-18 00:24:42,904 INFO L280 TraceCheckUtils]: 49: Hoare triple {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {5002#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-18 00:24:42,905 INFO L280 TraceCheckUtils]: 50: Hoare triple {5002#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {4980#false} is VALID [2020-07-18 00:24:42,905 INFO L280 TraceCheckUtils]: 51: Hoare triple {4980#false} havoc #t~mem8; {4980#false} is VALID [2020-07-18 00:24:42,905 INFO L280 TraceCheckUtils]: 52: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2020-07-18 00:24:42,915 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-18 00:24:42,915 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:42,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799667888] [2020-07-18 00:24:42,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:42,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-18 00:24:42,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479561000] [2020-07-18 00:24:42,916 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2020-07-18 00:24:42,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:42,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 00:24:42,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 00:24:42,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 00:24:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:24:42,991 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2020-07-18 00:24:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:47,062 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-07-18 00:24:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-18 00:24:47,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2020-07-18 00:24:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:24:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 152 transitions. [2020-07-18 00:24:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:24:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 152 transitions. [2020-07-18 00:24:47,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 152 transitions. [2020-07-18 00:24:47,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:47,287 INFO L225 Difference]: With dead ends: 179 [2020-07-18 00:24:47,287 INFO L226 Difference]: Without dead ends: 176 [2020-07-18 00:24:47,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2020-07-18 00:24:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-07-18 00:24:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 117. [2020-07-18 00:24:47,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:47,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 117 states. [2020-07-18 00:24:47,925 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 117 states. [2020-07-18 00:24:47,925 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 117 states. [2020-07-18 00:24:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:47,932 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2020-07-18 00:24:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2020-07-18 00:24:47,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:47,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:47,933 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 176 states. [2020-07-18 00:24:47,933 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 176 states. [2020-07-18 00:24:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:47,939 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2020-07-18 00:24:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2020-07-18 00:24:47,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:47,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:47,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:47,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-18 00:24:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2020-07-18 00:24:47,944 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 53 [2020-07-18 00:24:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:47,944 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2020-07-18 00:24:47,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 00:24:47,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 124 transitions. [2020-07-18 00:24:48,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2020-07-18 00:24:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:24:48,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:48,281 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:48,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:24:48,282 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:48,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2144912159, now seen corresponding path program 1 times [2020-07-18 00:24:48,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:48,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1412861010] [2020-07-18 00:24:48,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:48,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:24:48,308 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:24:48,317 INFO L168 Benchmark]: Toolchain (without parser) took 28697.91 ms. Allocated memory was 145.8 MB in the beginning and 486.0 MB in the end (delta: 340.3 MB). Free memory was 101.5 MB in the beginning and 326.8 MB in the end (delta: -225.3 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,318 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 145.8 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.34 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 168.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,319 INFO L168 Benchmark]: Boogie Preprocessor took 70.83 ms. Allocated memory is still 202.9 MB. Free memory was 168.2 MB in the beginning and 165.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,322 INFO L168 Benchmark]: RCFGBuilder took 781.21 ms. Allocated memory is still 202.9 MB. Free memory was 165.0 MB in the beginning and 96.0 MB in the end (delta: 69.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,323 INFO L168 Benchmark]: TraceAbstraction took 27163.06 ms. Allocated memory was 202.9 MB in the beginning and 486.0 MB in the end (delta: 283.1 MB). Free memory was 95.4 MB in the beginning and 326.8 MB in the end (delta: -231.4 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:48,328 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 0.83 ms. Allocated memory is still 145.8 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.34 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 168.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.83 ms. Allocated memory is still 202.9 MB. Free memory was 168.2 MB in the beginning and 165.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.21 ms. Allocated memory is still 202.9 MB. Free memory was 165.0 MB in the beginning and 96.0 MB in the end (delta: 69.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27163.06 ms. Allocated memory was 202.9 MB in the beginning and 486.0 MB in the end (delta: 283.1 MB). Free memory was 95.4 MB in the beginning and 326.8 MB in the end (delta: -231.4 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...