/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:26:59,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:26:59,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:26:59,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:26:59,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:26:59,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:26:59,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:26:59,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:26:59,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:26:59,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:26:59,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:26:59,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:26:59,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:26:59,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:26:59,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:26:59,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:26:59,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:26:59,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:26:59,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:26:59,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:26:59,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:26:59,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:26:59,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:26:59,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:26:59,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:26:59,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:26:59,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:26:59,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:26:59,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:26:59,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:26:59,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:26:59,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:26:59,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:26:59,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:26:59,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:26:59,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:26:59,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:26:59,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:26:59,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:26:59,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:26:59,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:26:59,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:26:59,356 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:26:59,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:26:59,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:26:59,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:26:59,358 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:26:59,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:26:59,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:26:59,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:26:59,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:26:59,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:26:59,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:26:59,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:26:59,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:26:59,360 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:26:59,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:26:59,361 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:26:59,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:26:59,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:26:59,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:26:59,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:26:59,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:26:59,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:26:59,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:26:59,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:26:59,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:26:59,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:26:59,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:26:59,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:26:59,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:26:59,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:26:59,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:26:59,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:26:59,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:26:59,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:26:59,648 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:26:59,648 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-2.i [2020-07-08 12:26:59,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e1145c0/d290602741eb4dcd851bad8f873204ed/FLAG03b629ea5 [2020-07-08 12:27:00,216 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:27:00,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-2.i [2020-07-08 12:27:00,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e1145c0/d290602741eb4dcd851bad8f873204ed/FLAG03b629ea5 [2020-07-08 12:27:00,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e1145c0/d290602741eb4dcd851bad8f873204ed [2020-07-08 12:27:00,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:27:00,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:27:00,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:00,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:27:00,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:27:00,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:00" (1/1) ... [2020-07-08 12:27:00,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309ffff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:00, skipping insertion in model container [2020-07-08 12:27:00,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:00" (1/1) ... [2020-07-08 12:27:00,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:27:00,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:27:01,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:01,066 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:27:01,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:01,207 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:27:01,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01 WrapperNode [2020-07-08 12:27:01,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:01,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:27:01,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:27:01,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:27:01,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (1/1) ... [2020-07-08 12:27:01,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:27:01,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:27:01,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:27:01,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:27:01,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (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-08 12:27:01,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:27:01,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:27:01,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:27:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:27:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:27:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:27:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:27:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:27:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:27:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:27:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:27:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:27:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:27:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:27:01,368 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:27:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:27:01,370 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:27:01,371 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:27:01,372 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:27:01,373 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:27:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:27:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:27:02,145 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:27:02,145 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-08 12:27:02,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:02 BoogieIcfgContainer [2020-07-08 12:27:02,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:27:02,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:27:02,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:27:02,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:27:02,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:27:00" (1/3) ... [2020-07-08 12:27:02,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412700d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:02, skipping insertion in model container [2020-07-08 12:27:02,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:01" (2/3) ... [2020-07-08 12:27:02,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412700d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:02, skipping insertion in model container [2020-07-08 12:27:02,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:02" (3/3) ... [2020-07-08 12:27:02,158 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2020-07-08 12:27:02,169 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:27:02,177 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-08 12:27:02,191 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-08 12:27:02,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:27:02,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:27:02,215 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:27:02,215 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:27:02,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:27:02,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:27:02,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:27:02,216 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:27:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 12:27:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:27:02,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:02,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:02,244 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash -810798801, now seen corresponding path program 1 times [2020-07-08 12:27:02,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:02,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664538751] [2020-07-08 12:27:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:02,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {37#true} is VALID [2020-07-08 12:27:02,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 12:27:02,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #118#return; {37#true} is VALID [2020-07-08 12:27:02,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:02,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {37#true} is VALID [2020-07-08 12:27:02,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 12:27:02,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #118#return; {37#true} is VALID [2020-07-08 12:27:02,572 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret19 := main(); {37#true} is VALID [2020-07-08 12:27:02,573 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {37#true} is VALID [2020-07-08 12:27:02,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-08 12:27:02,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {38#false} is VALID [2020-07-08 12:27:02,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {38#false} is VALID [2020-07-08 12:27:02,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 12:27:02,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-08 12:27:02,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664538751] [2020-07-08 12:27:02,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:02,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:27:02,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438418463] [2020-07-08 12:27:02,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:27:02,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:02,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:27:02,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:02,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:27:02,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:27:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:02,640 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-08 12:27:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:02,995 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2020-07-08 12:27:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:27:02,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:27:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-08 12:27:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-08 12:27:03,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-08 12:27:03,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:03,166 INFO L225 Difference]: With dead ends: 59 [2020-07-08 12:27:03,166 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:27:03,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:27:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:27:03,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:03,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:27:03,223 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:27:03,223 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:27:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:03,228 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-08 12:27:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:27:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:03,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:03,229 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:27:03,229 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:27:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:03,233 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-08 12:27:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:27:03,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:03,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:03,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:03,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:27:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-08 12:27:03,240 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2020-07-08 12:27:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:03,240 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-08 12:27:03,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:27:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:27:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:27:03,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:03,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:03,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:27:03,243 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 622671912, now seen corresponding path program 1 times [2020-07-08 12:27:03,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:03,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179517891] [2020-07-08 12:27:03,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:03,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {198#true} is VALID [2020-07-08 12:27:03,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-08 12:27:03,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #118#return; {198#true} is VALID [2020-07-08 12:27:03,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {205#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:03,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {198#true} is VALID [2020-07-08 12:27:03,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-08 12:27:03,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #118#return; {198#true} is VALID [2020-07-08 12:27:03,376 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret19 := main(); {198#true} is VALID [2020-07-08 12:27:03,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 12:27:03,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {203#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 12:27:03,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {203#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 12:27:03,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {203#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {204#(not (= 0 main_~end~0.base))} is VALID [2020-07-08 12:27:03,385 INFO L280 TraceCheckUtils]: 9: Hoare triple {204#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {199#false} is VALID [2020-07-08 12:27:03,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-08 12:27:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:03,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179517891] [2020-07-08 12:27:03,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:03,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:27:03,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982776421] [2020-07-08 12:27:03,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-08 12:27:03,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:03,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:27:03,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:03,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:27:03,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:27:03,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:27:03,411 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2020-07-08 12:27:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:03,768 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:27:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:27:03,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-08 12:27:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:27:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-08 12:27:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:27:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-08 12:27:03,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-08 12:27:03,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:03,838 INFO L225 Difference]: With dead ends: 35 [2020-07-08 12:27:03,838 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:27:03,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:03,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:27:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2020-07-08 12:27:03,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:03,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 25 states. [2020-07-08 12:27:03,853 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 25 states. [2020-07-08 12:27:03,853 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 25 states. [2020-07-08 12:27:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:03,856 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:27:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:27:03,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:03,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:03,857 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 33 states. [2020-07-08 12:27:03,858 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 33 states. [2020-07-08 12:27:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:03,861 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:27:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:27:03,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:03,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:03,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:03,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:27:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-08 12:27:03,865 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2020-07-08 12:27:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:03,865 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-08 12:27:03,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:27:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-08 12:27:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:27:03,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:03,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:03,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:27:03,867 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 59124385, now seen corresponding path program 1 times [2020-07-08 12:27:03,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:03,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572109237] [2020-07-08 12:27:03,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:04,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {348#true} is VALID [2020-07-08 12:27:04,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 12:27:04,050 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #118#return; {348#true} is VALID [2020-07-08 12:27:04,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {356#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:04,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {348#true} is VALID [2020-07-08 12:27:04,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 12:27:04,052 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #118#return; {348#true} is VALID [2020-07-08 12:27:04,053 INFO L263 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret19 := main(); {348#true} is VALID [2020-07-08 12:27:04,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-08 12:27:04,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-08 12:27:04,057 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-08 12:27:04,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:04,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:04,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} goto; {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:04,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {354#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); {355#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-08 12:27:04,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {355#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume !(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {349#false} is VALID [2020-07-08 12:27:04,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-08 12:27:04,063 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-08 12:27:04,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572109237] [2020-07-08 12:27:04,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:04,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:04,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739872902] [2020-07-08 12:27:04,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:27:04,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:04,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:04,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:04,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:04,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:04,088 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-07-08 12:27:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:04,779 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-08 12:27:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:27:04,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:27:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-08 12:27:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-08 12:27:04,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-08 12:27:04,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:04,909 INFO L225 Difference]: With dead ends: 51 [2020-07-08 12:27:04,910 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 12:27:04,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 12:27:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2020-07-08 12:27:04,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:04,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 32 states. [2020-07-08 12:27:04,934 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 32 states. [2020-07-08 12:27:04,934 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 32 states. [2020-07-08 12:27:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:04,937 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:27:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:27:04,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:04,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:04,941 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 49 states. [2020-07-08 12:27:04,941 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 49 states. [2020-07-08 12:27:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:04,950 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:27:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:27:04,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:04,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:04,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:04,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:27:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-08 12:27:04,956 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2020-07-08 12:27:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:04,956 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-08 12:27:04,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 12:27:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:27:04,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:04,959 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:04,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:27:04,960 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1951969173, now seen corresponding path program 1 times [2020-07-08 12:27:04,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:04,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916586221] [2020-07-08 12:27:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:05,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {560#true} is VALID [2020-07-08 12:27:05,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-08 12:27:05,353 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-08 12:27:05,359 INFO L263 TraceCheckUtils]: 0: Hoare triple {560#true} call ULTIMATE.init(); {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:05,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {560#true} is VALID [2020-07-08 12:27:05,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-08 12:27:05,364 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-08 12:27:05,364 INFO L263 TraceCheckUtils]: 4: Hoare triple {560#true} call #t~ret19 := main(); {560#true} is VALID [2020-07-08 12:27:05,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {565#(and (= main_~list~0.base main_~end~0.base) (= (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 8)) ~unnamed1~0~BLACK) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:05,373 INFO L280 TraceCheckUtils]: 6: Hoare triple {565#(and (= main_~list~0.base main_~end~0.base) (= (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 8)) ~unnamed1~0~BLACK) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {565#(and (= main_~list~0.base main_~end~0.base) (= (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 8)) ~unnamed1~0~BLACK) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:05,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {565#(and (= main_~list~0.base main_~end~0.base) (= (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 8)) ~unnamed1~0~BLACK) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {566#(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 8))) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:05,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {566#(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 8))) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} is VALID [2020-07-08 12:27:05,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} is VALID [2020-07-08 12:27:05,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} is VALID [2020-07-08 12:27:05,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:05,387 INFO L280 TraceCheckUtils]: 12: Hoare triple {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:05,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} goto; {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:05,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {568#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); {569#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-08 12:27:05,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume !(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {561#false} is VALID [2020-07-08 12:27:05,391 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-08 12:27:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:05,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916586221] [2020-07-08 12:27:05,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788746488] [2020-07-08 12:27:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:05,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-08 12:27:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:05,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:05,733 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:05,734 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:05,752 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:05,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:05,761 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:05,778 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:05,779 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:05,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2020-07-08 12:27:05,788 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:05,788 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, |v_#valid_18|]. (and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= |#valid| (store |v_#valid_18| main_~list~0.base 1)) (= main_~list~0.base main_~end~0.base) (= |#memory_int| (store |v_#memory_int_29| main_~list~0.base (store (select |v_#memory_int_29| main_~list~0.base) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)))) [2020-07-08 12:27:05,789 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) [2020-07-08 12:27:05,952 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:05,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-08 12:27:05,956 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,061 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-07-08 12:27:06,062 INFO L624 ElimStorePlain]: treesize reduction 14, result has 88.9 percent of original size [2020-07-08 12:27:06,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:06,075 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,112 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:06,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-08 12:27:06,133 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,164 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,171 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:06,204 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,229 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2020-07-08 12:27:06,232 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,276 INFO L624 ElimStorePlain]: treesize reduction 20, result has 70.6 percent of original size [2020-07-08 12:27:06,284 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,284 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:114, output treesize:27 [2020-07-08 12:27:06,295 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:06,296 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_26|, v_main_~end~0.offset_22, |main_#t~malloc2.base|, |main_#t~malloc2.offset|, |v_#memory_int_30|, |v_#memory_int_31|, |v_#valid_19|, |v_#memory_int_35|]. (let ((.cse1 (+ |main_#t~malloc2.offset| 4)) (.cse2 (select |v_#memory_int_35| main_~list~0.base))) (and (= (select (select (let ((.cse0 (store |v_#memory_$Pointer$.base_26| main_~list~0.base (store (select |v_#memory_$Pointer$.base_26| main_~list~0.base) v_main_~end~0.offset_22 |main_#t~malloc2.base|)))) (store .cse0 |main_#t~malloc2.base| (store (select .cse0 |main_#t~malloc2.base|) .cse1 main_~list~0.base))) main_~list~0.base) v_main_~end~0.offset_22) main_~end~0.base) (= (store |v_#memory_int_31| |main_#t~malloc2.base| (store (select |v_#memory_int_31| |main_#t~malloc2.base|) .cse1 (select (select |v_#memory_int_30| |main_#t~malloc2.base|) .cse1))) |v_#memory_int_30|) (= 0 main_~list~0.offset) (= 1 (select |v_#valid_19| main_~list~0.base)) (= 0 (select |v_#valid_19| |main_#t~malloc2.base|)) (= (store |v_#memory_int_30| main_~end~0.base (store (select |v_#memory_int_30| main_~end~0.base) main_~end~0.offset (select (select |#memory_int| main_~end~0.base) main_~end~0.offset))) |#memory_int|) (= |#valid| (store |v_#valid_19| |main_#t~malloc2.base| 1)) (= (store |v_#memory_int_35| main_~list~0.base (store .cse2 v_main_~end~0.offset_22 (select (select |v_#memory_int_31| main_~list~0.base) v_main_~end~0.offset_22))) |v_#memory_int_31|) (<= v_main_~end~0.offset_22 main_~list~0.offset) (= ~unnamed1~0~BLACK (select .cse2 (+ main_~list~0.offset 8))))) [2020-07-08 12:27:06,296 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (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 8))) (= 1 (select |#valid| main_~end~0.base))) [2020-07-08 12:27:06,475 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,476 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-08 12:27:06,478 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,562 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,565 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|, |v_#memory_int_33|, |v_#memory_int_34|, |v_#memory_int_32|], 4=[|v_#memory_int_36|]} [2020-07-08 12:27:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:06,574 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,620 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,626 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:06,664 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,668 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:06,693 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,697 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:06,732 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:06,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:06,828 INFO L350 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2020-07-08 12:27:06,829 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2020-07-08 12:27:06,833 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:06,906 INFO L624 ElimStorePlain]: treesize reduction 18, result has 81.4 percent of original size [2020-07-08 12:27:06,980 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:06,980 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:249, output treesize:43 [2020-07-08 12:27:07,204 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:07,204 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_25|, v_main_~end~0.base_23, v_main_~end~0.offset_23, |main_#t~malloc6.base|, |main_#t~malloc6.offset|, |v_#memory_int_33|, main_~end~0.offset, |v_#valid_20|, |v_#memory_int_34|, |v_#memory_int_32|, |v_#memory_int_36|]. (let ((.cse0 (+ |main_#t~malloc6.offset| 4))) (let ((.cse1 (select (select (let ((.cse3 (store |v_#memory_$Pointer$.base_25| v_main_~end~0.base_23 (store (select |v_#memory_$Pointer$.base_25| v_main_~end~0.base_23) v_main_~end~0.offset_23 |main_#t~malloc6.base|)))) (store .cse3 |main_#t~malloc6.base| (store (select .cse3 |main_#t~malloc6.base|) .cse0 v_main_~end~0.base_23))) v_main_~end~0.base_23) v_main_~end~0.offset_23))) (let ((.cse2 (select |v_#memory_int_33| .cse1))) (and (= 0 main_~list~0.offset) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= 1 (select |v_#valid_20| v_main_~end~0.base_23)) (= (store |v_#memory_int_32| |main_#t~malloc6.base| (store (select |v_#memory_int_32| |main_#t~malloc6.base|) .cse0 (select (select |v_#memory_int_34| |main_#t~malloc6.base|) .cse0))) |v_#memory_int_34|) (= (store |v_#memory_int_36| v_main_~end~0.base_23 (store (store (select |v_#memory_int_36| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8) ~unnamed1~0~RED) v_main_~end~0.offset_23 (select (select |v_#memory_int_32| v_main_~end~0.base_23) v_main_~end~0.offset_23))) |v_#memory_int_32|) (= |#memory_int| (store |v_#memory_int_33| .cse1 (store .cse2 (+ main_~end~0.offset 8) ~unnamed1~0~BLACK))) (= ~unnamed1~0~BLACK (select (select |v_#memory_int_36| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |v_#valid_20| main_~list~0.base)) (= 0 (select |v_#valid_20| |main_#t~malloc6.base|)) (= (store |v_#memory_int_34| .cse1 (store (select |v_#memory_int_34| .cse1) main_~end~0.offset (select .cse2 main_~end~0.offset))) |v_#memory_int_33|))))) [2020-07-08 12:27:07,205 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc6.base|, main_~end~0.offset, v_main_~end~0.base_23, v_main_~end~0.offset_23]. (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (= 0 main_~list~0.offset) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|))) [2020-07-08 12:27:07,780 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-07-08 12:27:07,791 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:07,799 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:07,804 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:07,805 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2020-07-08 12:27:07,808 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:07,808 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, v_main_~end~0.base_23, v_main_~end~0.offset_23, |main_#t~malloc6.base|, v_prenex_1]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) 8))) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= .cse0 |main_#t~mem9|) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK .cse0) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) [2020-07-08 12:27:07,809 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem9|) [2020-07-08 12:27:07,810 INFO L263 TraceCheckUtils]: 0: Hoare triple {560#true} call ULTIMATE.init(); {560#true} is VALID [2020-07-08 12:27:07,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {560#true} is VALID [2020-07-08 12:27:07,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-08 12:27:07,811 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-08 12:27:07,811 INFO L263 TraceCheckUtils]: 4: Hoare triple {560#true} call #t~ret19 := main(); {560#true} is VALID [2020-07-08 12:27:07,814 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-08 12:27:07,816 INFO L280 TraceCheckUtils]: 6: Hoare triple {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-08 12:27:07,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {596#(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 8))) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:07,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(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 8))) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} is VALID [2020-07-08 12:27:07,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} is VALID [2020-07-08 12:27:07,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} is VALID [2020-07-08 12:27:07,863 INFO L280 TraceCheckUtils]: 11: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 8))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-08 12:27:07,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-08 12:27:07,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-08 12:27:07,867 INFO L280 TraceCheckUtils]: 14: Hoare triple {610#(and (= 0 main_~end~0.offset) (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_23 Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (not (= v_main_~end~0.base_23 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 8))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 8))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc6.base|)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))} call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); {569#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-08 12:27:07,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume !(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {561#false} is VALID [2020-07-08 12:27:07,868 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-08 12:27:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:07,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:07,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-08 12:27:07,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040721717] [2020-07-08 12:27:07,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-08 12:27:07,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:07,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:27:07,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:07,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:27:07,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:27:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:27:07,954 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2020-07-08 12:27:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:21,808 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2020-07-08 12:27:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:27:21,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-08 12:27:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:27:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-08 12:27:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:27:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-08 12:27:21,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2020-07-08 12:27:21,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:21,996 INFO L225 Difference]: With dead ends: 64 [2020-07-08 12:27:21,997 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 12:27:21,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:27:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 12:27:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 23. [2020-07-08 12:27:22,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:22,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 23 states. [2020-07-08 12:27:22,022 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 23 states. [2020-07-08 12:27:22,022 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 23 states. [2020-07-08 12:27:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:22,026 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:27:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-08 12:27:22,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:22,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:22,027 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 62 states. [2020-07-08 12:27:22,027 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 62 states. [2020-07-08 12:27:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:22,030 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:27:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-08 12:27:22,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:22,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:22,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:22,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:27:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-08 12:27:22,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2020-07-08 12:27:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:22,034 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-08 12:27:22,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:27:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:27:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:27:22,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:22,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:22,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:22,250 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash -506610811, now seen corresponding path program 1 times [2020-07-08 12:27:22,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:22,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901629659] [2020-07-08 12:27:22,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:22,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {872#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {864#true} is VALID [2020-07-08 12:27:22,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {864#true} assume true; {864#true} is VALID [2020-07-08 12:27:22,442 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {864#true} {864#true} #118#return; {864#true} is VALID [2020-07-08 12:27:22,443 INFO L263 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {872#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:22,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {864#true} is VALID [2020-07-08 12:27:22,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2020-07-08 12:27:22,444 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #118#return; {864#true} is VALID [2020-07-08 12:27:22,444 INFO L263 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret19 := main(); {864#true} is VALID [2020-07-08 12:27:22,444 INFO L280 TraceCheckUtils]: 5: Hoare triple {864#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {864#true} is VALID [2020-07-08 12:27:22,445 INFO L280 TraceCheckUtils]: 6: Hoare triple {864#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {864#true} is VALID [2020-07-08 12:27:22,445 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {864#true} is VALID [2020-07-08 12:27:22,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {864#true} is VALID [2020-07-08 12:27:22,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {864#true} is VALID [2020-07-08 12:27:22,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#true} goto; {864#true} is VALID [2020-07-08 12:27:22,446 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#true} call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); {869#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem9|)} is VALID [2020-07-08 12:27:22,447 INFO L280 TraceCheckUtils]: 12: Hoare triple {869#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem9|)} assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {870#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:22,447 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} goto; {870#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} is VALID [2020-07-08 12:27:22,448 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); {871#(= ~unnamed1~0~BLACK |main_#t~mem10|)} is VALID [2020-07-08 12:27:22,449 INFO L280 TraceCheckUtils]: 15: Hoare triple {871#(= ~unnamed1~0~BLACK |main_#t~mem10|)} assume ~unnamed1~0~RED == #t~mem10;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {865#false} is VALID [2020-07-08 12:27:22,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {865#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); {865#false} is VALID [2020-07-08 12:27:22,450 INFO L280 TraceCheckUtils]: 17: Hoare triple {865#false} assume #t~mem13.base == 0 && #t~mem13.offset == 0;havoc #t~mem13.base, #t~mem13.offset; {865#false} is VALID [2020-07-08 12:27:22,450 INFO L280 TraceCheckUtils]: 18: Hoare triple {865#false} assume !false; {865#false} is VALID [2020-07-08 12:27:22,451 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-08 12:27:22,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901629659] [2020-07-08 12:27:22,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:22,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:22,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926885034] [2020-07-08 12:27:22,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 12:27:22,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:22,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:22,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:22,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:22,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:22,484 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2020-07-08 12:27:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:22,921 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:27:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:22,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 12:27:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 12:27:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 12:27:22,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-08 12:27:22,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:22,988 INFO L225 Difference]: With dead ends: 39 [2020-07-08 12:27:22,988 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 12:27:22,989 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:27:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 12:27:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-07-08 12:27:23,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:23,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2020-07-08 12:27:23,015 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2020-07-08 12:27:23,015 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2020-07-08 12:27:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:23,018 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-08 12:27:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:23,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:23,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:23,018 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2020-07-08 12:27:23,019 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2020-07-08 12:27:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:23,020 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-08 12:27:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:23,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:23,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:23,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:23,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:27:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-08 12:27:23,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2020-07-08 12:27:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:23,024 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-08 12:27:23,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-08 12:27:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:27:23,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:23,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:23,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:27:23,025 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:23,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash -506551229, now seen corresponding path program 1 times [2020-07-08 12:27:23,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:23,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231850361] [2020-07-08 12:27:23,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:27:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:27:23,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:27:23,071 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:27:23,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:27:23,104 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:27:23,104 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:27:23,104 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: L1010-2 has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: L1010-2 has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:27:23,105 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1002-3 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1010 has no Hoare annotation [2020-07-08 12:27:23,106 WARN L170 areAnnotationChecker]: L1010 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-08 12:27:23,107 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-08 12:27:23,108 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1047-2 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1047-2 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1047-2 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-08 12:27:23,109 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040-5 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-08 12:27:23,110 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2020-07-08 12:27:23,111 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2020-07-08 12:27:23,111 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:27:23,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:27:23 BoogieIcfgContainer [2020-07-08 12:27:23,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:27:23,116 INFO L168 Benchmark]: Toolchain (without parser) took 22577.34 ms. Allocated memory was 138.4 MB in the beginning and 298.8 MB in the end (delta: 160.4 MB). Free memory was 100.5 MB in the beginning and 141.3 MB in the end (delta: -40.8 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:27:23,117 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:27:23,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.44 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.1 MB in the beginning and 169.5 MB in the end (delta: -69.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:27:23,118 INFO L168 Benchmark]: Boogie Preprocessor took 74.62 ms. Allocated memory is still 204.5 MB. Free memory was 169.5 MB in the beginning and 166.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:27:23,119 INFO L168 Benchmark]: RCFGBuilder took 866.20 ms. Allocated memory is still 204.5 MB. Free memory was 166.5 MB in the beginning and 103.7 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:27:23,120 INFO L168 Benchmark]: TraceAbstraction took 20962.85 ms. Allocated memory was 204.5 MB in the beginning and 298.8 MB in the end (delta: 94.4 MB). Free memory was 103.7 MB in the beginning and 141.3 MB in the end (delta: -37.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:27:23,123 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.21 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 667.44 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.1 MB in the beginning and 169.5 MB in the end (delta: -69.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.62 ms. Allocated memory is still 204.5 MB. Free memory was 169.5 MB in the beginning and 166.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.20 ms. Allocated memory is still 204.5 MB. Free memory was 166.5 MB in the beginning and 103.7 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20962.85 ms. Allocated memory was 204.5 MB in the beginning and 298.8 MB in the end (delta: 94.4 MB). Free memory was 103.7 MB in the beginning and 141.3 MB in the end (delta: -37.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1030] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.8s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 134 SDtfs, 148 SDslu, 286 SDs, 0 SdLazy, 415 SolverSat, 46 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 10486 SizeOfPredicates, 15 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...