java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:27:46,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:27:46,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:27:46,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:27:46,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:27:46,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:27:46,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:27:46,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:27:46,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:27:46,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:27:46,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:27:46,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:27:46,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:27:46,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:27:46,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:27:46,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:27:46,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:27:46,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:27:46,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:27:46,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:27:46,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:27:46,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:27:46,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:27:46,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:27:46,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:27:46,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:27:46,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:27:46,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:27:46,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:27:46,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:27:46,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:27:46,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:27:46,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:27:46,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:27:46,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:27:46,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:27:46,296 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:27:46,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:27:46,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:27:46,313 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:27:46,315 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:27:46,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:27:46,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:27:46,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:27:46,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:27:46,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:27:46,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:27:46,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:27:46,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:27:46,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:27:46,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:27:46,319 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:27:46,320 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:27:46,320 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:27:46,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:27:46,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:27:46,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:27:46,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:27:46,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:27:46,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:27:46,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:27:46,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:27:46,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:27:46,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:27:46,323 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:27:46,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:27:46,324 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:27:46,324 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:27:46,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:27:46,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:27:46,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:27:46,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:27:46,409 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:27:46,409 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:27:46,410 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:27:46,469 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c216cd16c/fbad070a5f33409ebffb036b1745f7a0/FLAGe5f30649a [2018-11-14 16:27:47,051 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:27:47,052 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:27:47,067 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c216cd16c/fbad070a5f33409ebffb036b1745f7a0/FLAGe5f30649a [2018-11-14 16:27:47,081 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c216cd16c/fbad070a5f33409ebffb036b1745f7a0 [2018-11-14 16:27:47,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:27:47,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:27:47,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:27:47,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:27:47,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:27:47,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e0d818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47, skipping insertion in model container [2018-11-14 16:27:47,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:27:47,185 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:27:47,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:27:47,626 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:27:47,772 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:27:47,838 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:27:47,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47 WrapperNode [2018-11-14 16:27:47,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:27:47,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:27:47,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:27:47,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:27:47,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (1/1) ... [2018-11-14 16:27:47,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:27:47,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:27:47,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:27:47,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:27:47,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (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 [2018-11-14 16:27:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:27:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:27:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:27:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:27:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:27:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:27:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:27:47,999 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:27:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:27:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:27:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:27:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:27:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:27:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:27:48,006 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:27:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:27:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:27:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:27:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:27:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:27:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:27:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:27:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:27:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:27:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:27:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:27:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:27:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:27:49,261 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:27:49,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:27:49 BoogieIcfgContainer [2018-11-14 16:27:49,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:27:49,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:27:49,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:27:49,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:27:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:27:47" (1/3) ... [2018-11-14 16:27:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41180d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:27:49, skipping insertion in model container [2018-11-14 16:27:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:27:47" (2/3) ... [2018-11-14 16:27:49,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41180d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:27:49, skipping insertion in model container [2018-11-14 16:27:49,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:27:49" (3/3) ... [2018-11-14 16:27:49,270 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:27:49,281 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:27:49,289 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-14 16:27:49,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-14 16:27:49,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:27:49,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:27:49,344 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:27:49,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:27:49,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:27:49,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:27:49,348 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:27:49,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:27:49,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:27:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 16:27:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:27:49,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:27:49,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:27:49,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:27:49,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:27:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash 827631655, now seen corresponding path program 1 times [2018-11-14 16:27:49,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:27:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:27:49,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:27:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:49,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:27:49,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 16:27:49,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 16:27:49,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 16:27:49,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #144#return; {45#true} is VALID [2018-11-14 16:27:49,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret16 := main(); {45#true} is VALID [2018-11-14 16:27:49,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {45#true} is VALID [2018-11-14 16:27:49,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 16:27:49,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {46#false} is VALID [2018-11-14 16:27:49,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:27:49,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {46#false} is VALID [2018-11-14 16:27:49,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 16:27:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:27:49,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:27:49,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:27:49,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:27:49,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:27:49,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:27:49,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:27:49,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:49,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:27:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:27:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:27:49,642 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 16:27:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:50,075 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-14 16:27:50,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:27:50,076 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:27:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:27:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:27:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 16:27:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:27:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 16:27:50,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-14 16:27:50,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:50,955 INFO L225 Difference]: With dead ends: 75 [2018-11-14 16:27:50,955 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:27:50,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:27:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:27:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 16:27:51,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:27:51,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 16:27:51,041 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:27:51,041 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:27:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:51,051 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:27:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:27:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:51,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:51,056 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:27:51,056 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:27:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:51,064 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:27:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:27:51,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:51,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:51,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:27:51,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:27:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:27:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 16:27:51,074 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-14 16:27:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:27:51,074 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 16:27:51,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:27:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:27:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:27:51,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:27:51,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:27:51,076 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:27:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:27:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -525234885, now seen corresponding path program 1 times [2018-11-14 16:27:51,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:27:51,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:27:51,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:27:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:51,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:27:51,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-14 16:27:51,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {272#true} is VALID [2018-11-14 16:27:51,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-14 16:27:51,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #144#return; {272#true} is VALID [2018-11-14 16:27:51,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret16 := main(); {272#true} is VALID [2018-11-14 16:27:51,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {292#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:27:51,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {292#(not (= (_ bv0 32) main_~list~0.base))} assume true; {292#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:27:51,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(not (= (_ bv0 32) main_~list~0.base))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {292#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:27:51,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(not (= (_ bv0 32) main_~list~0.base))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {302#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:27:51,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {302#(not (= (_ bv0 32) main_~end~0.base))} assume true; {302#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:27:51,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#(not (= (_ bv0 32) main_~end~0.base))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {273#false} is VALID [2018-11-14 16:27:51,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-14 16:27:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:27:51,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:27:51,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:27:51,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:27:51,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:27:51,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:27:51,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:27:51,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:51,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:27:51,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:27:51,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:27:51,566 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-14 16:27:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:52,035 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:27:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:27:52,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:27:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:27:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:27:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-14 16:27:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:27:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-14 16:27:52,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-14 16:27:52,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:52,154 INFO L225 Difference]: With dead ends: 38 [2018-11-14 16:27:52,154 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:27:52,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:27:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:27:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-14 16:27:52,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:27:52,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-14 16:27:52,172 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-14 16:27:52,172 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-14 16:27:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:52,176 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:27:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:27:52,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:52,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:52,178 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-14 16:27:52,178 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-14 16:27:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:52,181 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:27:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:27:52,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:52,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:52,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:27:52,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:27:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:27:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 16:27:52,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2018-11-14 16:27:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:27:52,185 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 16:27:52,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:27:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:27:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:27:52,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:27:52,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:27:52,186 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:27:52,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:27:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -702652304, now seen corresponding path program 1 times [2018-11-14 16:27:52,187 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:27:52,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:27:52,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:27:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:52,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:27:52,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:27:52,343 INFO L477 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 10 treesize of output 9 [2018-11-14 16:27:52,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 16:27:52,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:27:52,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:27:52,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:52,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:27:52,622 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:27:52,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2018-11-14 16:27:52,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {469#true} is VALID [2018-11-14 16:27:52,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2018-11-14 16:27:52,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #144#return; {469#true} is VALID [2018-11-14 16:27:52,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret16 := main(); {469#true} is VALID [2018-11-14 16:27:52,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {469#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:52,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:52,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:52,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:27:52,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:27:52,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:27:52,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:27:52,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {499#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {512#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:27:52,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {512#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {470#false} is VALID [2018-11-14 16:27:52,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {470#false} assume !false; {470#false} is VALID [2018-11-14 16:27:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:27:52,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:27:52,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:27:52,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:27:52,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:27:52,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:27:52,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:27:52,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:52,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:27:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:27:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:27:52,685 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-14 16:27:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:53,935 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-14 16:27:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:27:53,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:27:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:27:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:27:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 16:27:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:27:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 16:27:53,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 16:27:54,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:27:54,116 INFO L225 Difference]: With dead ends: 68 [2018-11-14 16:27:54,117 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:27:54,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:27:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:27:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-11-14 16:27:54,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:27:54,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2018-11-14 16:27:54,189 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2018-11-14 16:27:54,189 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2018-11-14 16:27:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:54,194 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 16:27:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 16:27:54,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:54,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:54,195 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2018-11-14 16:27:54,195 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2018-11-14 16:27:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:27:54,199 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 16:27:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 16:27:54,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:27:54,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:27:54,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:27:54,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:27:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 16:27:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 16:27:54,204 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-11-14 16:27:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:27:54,204 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 16:27:54,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:27:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 16:27:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:27:54,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:27:54,206 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:27:54,206 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:27:54,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:27:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2013090473, now seen corresponding path program 1 times [2018-11-14 16:27:54,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:27:54,207 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:27:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:27:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:27:54,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:27:54,455 INFO L477 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 [2018-11-14 16:27:54,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:27:54,492 INFO L477 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 10 treesize of output 9 [2018-11-14 16:27:54,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-14 16:27:54,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:27:54,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:27:54,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:27:54,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 16:27:54,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-14 16:27:54,590 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:27:54,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-14 16:27:54,674 INFO L477 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 10 treesize of output 9 [2018-11-14 16:27:54,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:54,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2018-11-14 16:27:54,882 INFO L477 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 39 treesize of output 38 [2018-11-14 16:27:54,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:55,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:27:55,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2018-11-14 16:27:55,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:27:55,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:27:55,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:27:55,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-14 16:27:55,358 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:48, output treesize:58 [2018-11-14 16:27:55,614 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:27:55,803 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-14 16:27:56,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-14 16:27:56,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:27:56,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:27:56,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-14 16:27:56,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-11-14 16:27:56,272 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:27:56,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:27:56,320 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2018-11-14 16:27:56,328 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:27:56,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-14 16:27:56,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-14 16:27:56,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-14 16:27:56,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #144#return; {784#true} is VALID [2018-11-14 16:27:56,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret16 := main(); {784#true} is VALID [2018-11-14 16:27:56,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {784#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {804#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:56,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {804#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:56,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {811#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:27:56,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:27:56,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume true; {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:27:56,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:27:56,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {815#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:27:56,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true; {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:27:56,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:27:56,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true; {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:27:56,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {825#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {838#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:27:56,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {838#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {785#false} is VALID [2018-11-14 16:27:56,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-14 16:27:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:27:56,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:28:02,974 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:02,975 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:77, output treesize:1 [2018-11-14 16:28:02,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-14 16:28:02,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {838#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {785#false} is VALID [2018-11-14 16:28:02,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {838#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:28:02,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:02,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:02,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:02,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {851#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:02,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:02,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume true; {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:03,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {874#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {864#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:03,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {878#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {874#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:28:03,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {878#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} assume true; {878#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} is VALID [2018-11-14 16:28:03,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {784#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {878#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} is VALID [2018-11-14 16:28:03,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret16 := main(); {784#true} is VALID [2018-11-14 16:28:03,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #144#return; {784#true} is VALID [2018-11-14 16:28:03,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-14 16:28:03,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-14 16:28:03,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-14 16:28:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:28:03,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:28:03,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 16:28:03,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 16:28:03,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:28:03,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:28:03,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:03,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:28:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:28:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2018-11-14 16:28:03,162 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states. [2018-11-14 16:28:04,526 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2018-11-14 16:28:09,107 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-14 16:28:09,701 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-11-14 16:28:14,926 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-14 16:28:15,702 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-14 16:28:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:16,203 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 16:28:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:28:16,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 16:28:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:28:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:28:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 16:28:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:28:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 16:28:16,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-14 16:28:16,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:16,431 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:28:16,431 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:28:16,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=112, Invalid=266, Unknown=2, NotChecked=0, Total=380 [2018-11-14 16:28:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:28:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 30. [2018-11-14 16:28:16,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:28:16,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 30 states. [2018-11-14 16:28:16,457 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 30 states. [2018-11-14 16:28:16,457 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 30 states. [2018-11-14 16:28:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:16,460 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 16:28:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 16:28:16,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:16,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:16,462 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 74 states. [2018-11-14 16:28:16,462 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 74 states. [2018-11-14 16:28:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:16,466 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 16:28:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 16:28:16,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:16,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:16,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:28:16,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:28:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:28:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-14 16:28:16,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-14 16:28:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:28:16,470 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-14 16:28:16,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:28:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:28:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:28:16,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:28:16,471 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:28:16,471 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:28:16,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:28:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1167298014, now seen corresponding path program 1 times [2018-11-14 16:28:16,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:28:16,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:28:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:28:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:16,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:28:16,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:28:16,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-14 16:28:16,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:16,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:16,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:16,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:28:16,615 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:16,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-14 16:28:16,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1194#true} is VALID [2018-11-14 16:28:16,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:28:16,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #144#return; {1194#true} is VALID [2018-11-14 16:28:16,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret16 := main(); {1194#true} is VALID [2018-11-14 16:28:16,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1194#true} is VALID [2018-11-14 16:28:16,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:28:16,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1194#true} is VALID [2018-11-14 16:28:16,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1194#true} is VALID [2018-11-14 16:28:16,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:28:16,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {1194#true} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1194#true} is VALID [2018-11-14 16:28:16,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:28:16,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {1194#true} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1235#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:16,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {1235#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:16,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:16,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:28:16,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {1239#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1249#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 16:28:16,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {1249#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1195#false} is VALID [2018-11-14 16:28:16,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-14 16:28:16,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {1195#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1195#false} is VALID [2018-11-14 16:28:16,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-14 16:28:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:28:16,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:28:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:28:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:28:16,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:28:16,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:28:16,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:28:16,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:16,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:28:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:28:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:28:16,664 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-11-14 16:28:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:17,478 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 16:28:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:28:17,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:28:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:28:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:28:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:28:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:28:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:28:17,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 16:28:17,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:17,591 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:28:17,591 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:28:17,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:28:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:28:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 16:28:17,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:28:17,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 16:28:17,615 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 16:28:17,615 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 16:28:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:17,618 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:28:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:28:17,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:17,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:17,619 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 16:28:17,619 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 16:28:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:17,621 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:28:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:28:17,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:17,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:17,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:28:17,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:28:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:28:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 16:28:17,623 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-14 16:28:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:28:17,624 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 16:28:17,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:28:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 16:28:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:28:17,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:28:17,625 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:28:17,625 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:28:17,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:28:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1449495770, now seen corresponding path program 1 times [2018-11-14 16:28:17,626 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:28:17,626 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:28:17,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:28:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:17,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:28:17,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:28:17,742 INFO L477 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 8 treesize of output 7 [2018-11-14 16:28:17,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:28:17,772 INFO L477 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 8 treesize of output 7 [2018-11-14 16:28:17,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-14 16:28:17,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:28:17,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:28:17,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:28:17,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:28:17,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:17,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 16:28:17,967 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:17,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {1427#true} call ULTIMATE.init(); {1427#true} is VALID [2018-11-14 16:28:17,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {1427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1427#true} is VALID [2018-11-14 16:28:17,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {1427#true} assume true; {1427#true} is VALID [2018-11-14 16:28:17,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1427#true} {1427#true} #144#return; {1427#true} is VALID [2018-11-14 16:28:17,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {1427#true} call #t~ret16 := main(); {1427#true} is VALID [2018-11-14 16:28:17,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {1427#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:17,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume true; {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {1447#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume true; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume true; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume true; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume true; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {1457#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume true; {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1428#false} is VALID [2018-11-14 16:28:18,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#false} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1428#false} is VALID [2018-11-14 16:28:18,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {1428#false} assume true; {1428#false} is VALID [2018-11-14 16:28:18,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {1428#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1428#false} is VALID [2018-11-14 16:28:18,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {1428#false} assume !false; {1428#false} is VALID [2018-11-14 16:28:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:28:18,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:28:18,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {1428#false} assume !false; {1428#false} is VALID [2018-11-14 16:28:18,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {1428#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1428#false} is VALID [2018-11-14 16:28:18,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {1428#false} assume true; {1428#false} is VALID [2018-11-14 16:28:18,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#false} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1428#false} is VALID [2018-11-14 16:28:18,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1428#false} is VALID [2018-11-14 16:28:18,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume true; {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {1488#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:18,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1525#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:28:18,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 16:28:18,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume true; {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 16:28:18,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {1427#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1556#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 16:28:18,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {1427#true} call #t~ret16 := main(); {1427#true} is VALID [2018-11-14 16:28:18,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1427#true} {1427#true} #144#return; {1427#true} is VALID [2018-11-14 16:28:18,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {1427#true} assume true; {1427#true} is VALID [2018-11-14 16:28:18,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {1427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1427#true} is VALID [2018-11-14 16:28:18,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {1427#true} call ULTIMATE.init(); {1427#true} is VALID [2018-11-14 16:28:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:28:18,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:28:18,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 16:28:18,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:28:18,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:28:18,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:28:18,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:18,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:28:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:28:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:28:18,389 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2018-11-14 16:28:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:19,900 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-14 16:28:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:28:19,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:28:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:28:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:28:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 16:28:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:28:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 16:28:19,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-14 16:28:20,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:28:20,046 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:28:20,046 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 16:28:20,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:28:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 16:28:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 16:28:20,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:28:20,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 16:28:20,119 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:28:20,119 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:28:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:20,121 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 16:28:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:28:20,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:20,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:20,122 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:28:20,122 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:28:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:28:20,124 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 16:28:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:28:20,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:28:20,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:28:20,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:28:20,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:28:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:28:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 16:28:20,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2018-11-14 16:28:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:28:20,127 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 16:28:20,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:28:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:28:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:28:20,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:28:20,128 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:28:20,128 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:28:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:28:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1709093407, now seen corresponding path program 1 times [2018-11-14 16:28:20,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:28:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:28:20,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:28:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:28:20,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:28:20,261 INFO L477 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 [2018-11-14 16:28:20,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-14 16:28:20,283 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:20,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:20,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:20,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-14 16:28:20,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:28:20,702 INFO L477 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 8 treesize of output 7 [2018-11-14 16:28:20,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:28:20,803 INFO L477 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 8 treesize of output 11 [2018-11-14 16:28:20,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:28:20,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:28:20,932 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:20,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:28:20,985 INFO L477 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 8 treesize of output 11 [2018-11-14 16:28:20,989 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:21,002 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:21,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:21,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:21,045 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-14 16:28:21,823 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:21,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:21,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:21,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:21,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-14 16:28:21,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,186 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:22,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 111 [2018-11-14 16:28:22,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-14 16:28:22,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 110 [2018-11-14 16:28:22,318 INFO L477 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 8 treesize of output 7 [2018-11-14 16:28:22,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:22,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 81 [2018-11-14 16:28:22,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2018-11-14 16:28:22,551 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-11-14 16:28:22,630 INFO L477 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 8 treesize of output 7 [2018-11-14 16:28:22,631 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,656 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:22,729 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:167, output treesize:117 [2018-11-14 16:28:22,815 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:23,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 102 [2018-11-14 16:28:23,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 76 treesize of output 61 [2018-11-14 16:28:23,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:28:23,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:28:23,457 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:71 [2018-11-14 16:28:23,470 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:23,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:28:23,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 52 [2018-11-14 16:28:23,823 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-14 16:28:23,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-14 16:28:23,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-14 16:28:23,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2018-11-14 16:28:23,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-14 16:28:23,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:23,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-14 16:28:23,999 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:24,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:24,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:28:24,034 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:163, output treesize:4 [2018-11-14 16:28:24,045 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:28:24,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2018-11-14 16:28:24,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {1772#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1772#true} is VALID [2018-11-14 16:28:24,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2018-11-14 16:28:24,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #144#return; {1772#true} is VALID [2018-11-14 16:28:24,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret16 := main(); {1772#true} is VALID [2018-11-14 16:28:24,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {1772#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1792#(and (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:24,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1792#(and (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume true; {1792#(and (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:24,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {1792#(and (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {1799#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)) (not (= main_~list~0.base main_~end~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:28:24,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {1799#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)) (not (= main_~list~0.base main_~end~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} is VALID [2018-11-14 16:28:24,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} assume true; {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} is VALID [2018-11-14 16:28:24,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} is VALID [2018-11-14 16:28:24,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {1803#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (_ bv0 32))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~list~0.base)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume true; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume true; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume true; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume true; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:28:24,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {1813#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {1844#(exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))))))} is VALID [2018-11-14 16:28:24,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {1844#(exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))))))} assume true; {1844#(exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))))))} is VALID [2018-11-14 16:28:24,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {1844#(exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1851#(or (and (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))))) (not (= (_ bv0 32) main_~end~0.base))) (and (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))))) (not (= main_~end~0.offset (_ bv0 32)))))} is VALID [2018-11-14 16:28:24,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {1851#(or (and (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))))) (not (= (_ bv0 32) main_~end~0.base))) (and (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) v_main_~end~0.base_35)) (not (= v_main_~end~0.base_35 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) main_~end~0.offset) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)))))) (not (= main_~end~0.offset (_ bv0 32)))))} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1855#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:28:24,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {1855#(not (= (_ bv0 32) main_~end~0.base))} assume true; {1855#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:28:24,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {1855#(not (= (_ bv0 32) main_~end~0.base))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1773#false} is VALID [2018-11-14 16:28:24,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2018-11-14 16:28:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:28:24,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:28:29,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 211 [2018-11-14 16:28:29,565 INFO L477 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 9 treesize of output 8 [2018-11-14 16:28:29,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:29,942 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-11-14 16:28:30,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 123 [2018-11-14 16:28:31,554 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-11-14 16:28:31,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 100 [2018-11-14 16:28:31,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:31,588 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:28:31,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:31,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:31,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 109 [2018-11-14 16:28:31,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:32,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:32,433 INFO L303 Elim1Store]: Index analysis took 173 ms [2018-11-14 16:28:32,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 142 [2018-11-14 16:28:32,648 INFO L477 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 114 treesize of output 113 [2018-11-14 16:28:32,655 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:33,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 173 [2018-11-14 16:28:33,912 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:35,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 113 [2018-11-14 16:28:35,290 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:36,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 170 [2018-11-14 16:28:36,684 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:38,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:38,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 133 [2018-11-14 16:28:38,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:38,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:38,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:38,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 229 [2018-11-14 16:28:38,517 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:41,712 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:41,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:41,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 155 [2018-11-14 16:28:41,749 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:44,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:44,099 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:44,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:44,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 223 [2018-11-14 16:28:44,169 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:46,239 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:46,243 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:28:46,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 101 [2018-11-14 16:28:46,276 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:48,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 21 [2018-11-14 16:28:48,369 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:48,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 18 [2018-11-14 16:28:48,390 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:50,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 105 treesize of output 99 [2018-11-14 16:28:50,199 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:51,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-11-14 16:28:52,005 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:53,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 21 [2018-11-14 16:28:53,742 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:55,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 97 treesize of output 91 [2018-11-14 16:28:55,255 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:56,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 154 [2018-11-14 16:28:56,950 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-14 16:28:58,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-14 16:28:58,067 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:58,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 87 [2018-11-14 16:28:58,759 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-14 16:28:59,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 95 [2018-11-14 16:28:59,315 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-14 16:29:00,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 92 [2018-11-14 16:29:00,383 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-14 16:29:00,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 12 [2018-11-14 16:29:00,912 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:02,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 9 [2018-11-14 16:29:02,403 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:02,520 INFO L267 ElimStorePlain]: Start of recursive call 13: 26 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:02,550 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:29:02,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 135 [2018-11-14 16:29:02,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 109 [2018-11-14 16:29:02,892 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-14 16:29:08,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 103 [2018-11-14 16:29:08,495 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-14 16:29:13,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 35 [2018-11-14 16:29:13,766 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:13,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 36 [2018-11-14 16:29:13,777 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:18,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 32 [2018-11-14 16:29:18,037 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 33 [2018-11-14 16:29:18,049 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:22,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 30 [2018-11-14 16:29:22,324 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:22,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 29 [2018-11-14 16:29:22,338 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:27,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 16:29:27,225 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:27,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-14 16:29:27,242 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:29,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-14 16:29:29,560 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:29,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-14 16:29:29,573 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts.