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-18e5b2d-m [2018-11-18 21:55:56,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:55:56,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:55:56,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:55:56,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:55:56,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:55:56,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:55:56,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:55:56,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:55:56,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:55:56,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:55:56,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:55:56,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:55:56,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:55:56,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:55:56,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:55:56,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:55:56,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:55:56,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:55:56,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:55:56,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:55:56,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:55:56,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:55:56,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:55:56,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:55:56,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:55:56,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:55:56,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:55:56,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:55:56,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:55:56,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:55:56,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:55:56,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:55:56,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:55:56,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:55:56,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:55:56,725 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-18 21:55:56,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:55:56,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:55:56,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:55:56,743 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:55:56,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:55:56,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:55:56,744 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:55:56,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:55:56,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:55:56,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:55:56,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:55:56,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:55:56,745 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:55:56,745 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:55:56,746 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:55:56,746 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:55:56,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:55:56,746 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:55:56,746 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:55:56,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:55:56,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:55:56,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:55:56,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:55:56,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:55:56,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:55:56,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:55:56,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:55:56,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:55:56,749 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:55:56,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:55:56,749 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:55:56,749 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:55:56,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:55:56,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:55:56,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:55:56,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:55:56,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:55:56,815 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:55:56,815 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-18 21:55:56,865 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9260add0/88c647ce11fa448382cfa6667c5e3bfa/FLAG408cb7df0 [2018-11-18 21:55:57,461 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:55:57,462 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:55:57,477 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9260add0/88c647ce11fa448382cfa6667c5e3bfa/FLAG408cb7df0 [2018-11-18 21:55:57,687 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9260add0/88c647ce11fa448382cfa6667c5e3bfa [2018-11-18 21:55:57,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:55:57,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:55:57,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:55:57,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:55:57,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:55:57,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:57" (1/1) ... [2018-11-18 21:55:57,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0a4a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:57, skipping insertion in model container [2018-11-18 21:55:57,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:57" (1/1) ... [2018-11-18 21:55:57,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:55:57,782 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:55:58,178 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:55:58,199 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:55:58,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:55:58,414 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:55:58,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58 WrapperNode [2018-11-18 21:55:58,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:55:58,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:55:58,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:55:58,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:55:58,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (1/1) ... [2018-11-18 21:55:58,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:55:58,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:55:58,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:55:58,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:55:58,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (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-18 21:55:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:55:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:55:58,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:55:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:55:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:55:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:55:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:55:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:55:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:55:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:55:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:55:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:55:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:55:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:55:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:55:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:55:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:55:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:55:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:55:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:55:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:55:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:55:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:55:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:55:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:55:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:55:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:55:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 21:55:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:55:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:55:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 21:55:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:55:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:55:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:55:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:55:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:55:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:55:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:55:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:55:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:55:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:55:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:55:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:55:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:55:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:55:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:55:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:55:59,726 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:55:59,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:59 BoogieIcfgContainer [2018-11-18 21:55:59,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:55:59,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:55:59,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:55:59,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:55:59,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:55:57" (1/3) ... [2018-11-18 21:55:59,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475124c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:59, skipping insertion in model container [2018-11-18 21:55:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:58" (2/3) ... [2018-11-18 21:55:59,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475124c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:59, skipping insertion in model container [2018-11-18 21:55:59,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:59" (3/3) ... [2018-11-18 21:55:59,735 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:55:59,745 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:55:59,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-18 21:55:59,770 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-18 21:55:59,804 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:55:59,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:55:59,805 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:55:59,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:55:59,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:55:59,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:55:59,806 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:55:59,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:55:59,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:55:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 21:55:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:55:59,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:55:59,833 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:55:59,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:55:59,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:55:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash 827631655, now seen corresponding path program 1 times [2018-11-18 21:55:59,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:55:59,849 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-18 21:55:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:55:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:55:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:55:59,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:55:59,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-18 21:55:59,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-18 21:55:59,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-18 21:55:59,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #144#return; {45#true} is VALID [2018-11-18 21:55:59,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret16 := main(); {45#true} is VALID [2018-11-18 21:55:59,989 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-18 21:55:59,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-18 21:55:59,991 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-18 21:55:59,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:55:59,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {46#false} is VALID [2018-11-18 21:55:59,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-18 21:55:59,995 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-18 21:55:59,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:00,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:56:00,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:56:00,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:00,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:56:00,107 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-18 21:56:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:56:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:56:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:56:00,121 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-18 21:56:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:00,335 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-18 21:56:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:56:00,336 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:56:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:56:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-18 21:56:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:56:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-18 21:56:00,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-18 21:56:01,386 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-18 21:56:01,398 INFO L225 Difference]: With dead ends: 75 [2018-11-18 21:56:01,399 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 21:56:01,403 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-18 21:56:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 21:56:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 21:56:01,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:01,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:01,444 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:01,444 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:01,449 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:01,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:01,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:01,451 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:01,451 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:01,456 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:01,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:01,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:01,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:01,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 21:56:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-18 21:56:01,462 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-18 21:56:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:01,463 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-18 21:56:01,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:56:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 21:56:01,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:01,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:01,464 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:01,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash -525234885, now seen corresponding path program 1 times [2018-11-18 21:56:01,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:01,466 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-18 21:56:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:01,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:01,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-18 21:56:01,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {272#true} is VALID [2018-11-18 21:56:01,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-18 21:56:01,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #144#return; {272#true} is VALID [2018-11-18 21:56:01,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret16 := main(); {272#true} is VALID [2018-11-18 21:56:01,615 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-18 21:56:01,630 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-18 21:56:01,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(not (= (_ bv0 32) main_~list~0.base))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {292#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-18 21:56:01,658 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-18 21:56:01,659 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-18 21:56:01,663 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-18 21:56:01,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-18 21:56:01,664 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-18 21:56:01,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:01,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:56:01,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:56:01,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:01,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:56:01,689 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-18 21:56:01,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:56:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:56:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:56:01,691 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-18 21:56:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:02,207 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-18 21:56:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:56:02,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:56:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:56:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-18 21:56:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:56:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-18 21:56:02,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-18 21:56:02,317 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-18 21:56:02,319 INFO L225 Difference]: With dead ends: 38 [2018-11-18 21:56:02,319 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 21:56:02,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:56:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 21:56:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-18 21:56:02,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:02,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-18 21:56:02,336 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-18 21:56:02,336 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-18 21:56:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:02,339 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 21:56:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-18 21:56:02,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:02,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:02,340 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-18 21:56:02,341 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-18 21:56:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:02,344 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 21:56:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-18 21:56:02,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:02,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:02,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:02,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 21:56:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-18 21:56:02,348 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2018-11-18 21:56:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:02,348 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-18 21:56:02,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:56:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-18 21:56:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:56:02,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:02,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:02,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:02,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash -702652304, now seen corresponding path program 1 times [2018-11-18 21:56:02,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:02,351 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-18 21:56:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:02,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:02,612 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-18 21:56:02,652 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-18 21:56:02,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:02,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:02,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 21:56:02,938 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-18 21:56:02,949 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-18 21:56:02,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:02,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:03,001 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-18 21:56:03,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 21:56:03,005 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:03,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2018-11-18 21:56:03,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {469#true} is VALID [2018-11-18 21:56:03,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2018-11-18 21:56:03,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #144#return; {469#true} is VALID [2018-11-18 21:56:03,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret16 := main(); {469#true} is VALID [2018-11-18 21:56:03,025 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-18 21:56:03,025 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-18 21:56:03,026 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 !(0bv32 != #t~nondet1);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-18 21:56:03,028 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-18 21:56:03,030 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-18 21:56:03,031 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-18 21:56:03,033 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-18 21:56:03,035 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-18 21:56:03,036 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-18 21:56:03,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {470#false} assume !false; {470#false} is VALID [2018-11-18 21:56:03,038 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-18 21:56:03,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:03,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:56:03,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 21:56:03,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:03,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:56:03,066 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-18 21:56:03,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:56:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:56:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:56:03,068 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-18 21:56:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:04,320 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 21:56:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:56:04,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 21:56:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 21:56:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 21:56:04,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-18 21:56:04,464 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-18 21:56:04,468 INFO L225 Difference]: With dead ends: 68 [2018-11-18 21:56:04,468 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 21:56:04,469 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-18 21:56:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 21:56:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-11-18 21:56:04,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:04,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:04,522 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:04,522 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:04,527 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-18 21:56:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-18 21:56:04,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:04,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:04,529 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2018-11-18 21:56:04,529 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2018-11-18 21:56:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:04,533 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-18 21:56:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-18 21:56:04,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:04,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:04,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:04,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 21:56:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-18 21:56:04,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-11-18 21:56:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:04,538 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-18 21:56:04,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:56:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 21:56:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:56:04,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:04,539 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:04,540 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:04,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2013090473, now seen corresponding path program 1 times [2018-11-18 21:56:04,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:04,541 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-18 21:56:04,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:04,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:04,786 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-18 21:56:04,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:04,815 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-18 21:56:04,822 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-18 21:56:04,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:04,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:04,848 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-18 21:56:04,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-18 21:56:04,864 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:04,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:04,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:04,928 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-18 21:56:04,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:04,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:04,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-18 21:56:04,953 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:05,028 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-18 21:56:05,048 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-18 21:56:05,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:05,210 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-18 21:56:05,272 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-18 21:56:05,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:05,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:05,578 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-18 21:56:05,583 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:05,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:05,674 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-18 21:56:05,733 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-18 21:56:05,733 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:48, output treesize:58 [2018-11-18 21:56:05,981 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:06,135 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-18 21:56:06,510 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-18 21:56:06,521 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-18 21:56:06,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,535 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-18 21:56:06,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,587 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-18 21:56:06,596 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-18 21:56:06,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,612 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-18 21:56:06,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:06,646 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-18 21:56:06,647 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2018-11-18 21:56:06,654 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:06,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-18 21:56:06,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-18 21:56:06,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-18 21:56:06,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #144#return; {784#true} is VALID [2018-11-18 21:56:06,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret16 := main(); {784#true} is VALID [2018-11-18 21:56:06,677 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-18 21:56:06,677 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-18 21:56:06,679 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 !!(0bv32 != #t~nondet1);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-18 21:56:06,688 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 !(0bv32 != #t~nondet4);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-18 21:56:06,689 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-18 21:56:06,689 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 !(0bv32 != #t~nondet1);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-18 21:56:06,694 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-18 21:56:06,695 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-18 21:56:06,700 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-18 21:56:06,700 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-18 21:56:06,702 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-18 21:56:06,703 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-18 21:56:06,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-18 21:56:06,709 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-18 21:56:06,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:11,554 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:11,555 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:77, output treesize:1 [2018-11-18 21:56:11,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-18 21:56:11,567 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-18 21:56:11,568 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-18 21:56:11,569 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-18 21:56:11,569 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-18 21:56:11,570 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-18 21:56:11,573 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-18 21:56:11,574 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 !(0bv32 != #t~nondet1);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-18 21:56:11,574 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-18 21:56:11,582 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 !(0bv32 != #t~nondet4);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-18 21:56:11,591 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 !!(0bv32 != #t~nondet1);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-18 21:56:11,592 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-18 21:56:11,595 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-18 21:56:11,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret16 := main(); {784#true} is VALID [2018-11-18 21:56:11,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #144#return; {784#true} is VALID [2018-11-18 21:56:11,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-18 21:56:11,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-18 21:56:11,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-18 21:56:11,599 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-18 21:56:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:56:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 21:56:11,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-18 21:56:11,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:11,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 21:56:11,685 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-18 21:56:11,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 21:56:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 21:56:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2018-11-18 21:56:11,686 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states. [2018-11-18 21:56:17,266 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-18 21:56:17,696 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-11-18 21:56:22,934 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-18 21:56:23,900 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 21:56:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:24,591 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 21:56:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 21:56:24,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-18 21:56:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:56:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-18 21:56:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:56:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-18 21:56:24,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-18 21:56:24,796 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-18 21:56:24,799 INFO L225 Difference]: With dead ends: 76 [2018-11-18 21:56:24,799 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 21:56:24,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=112, Invalid=267, Unknown=1, NotChecked=0, Total=380 [2018-11-18 21:56:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 21:56:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 30. [2018-11-18 21:56:24,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:24,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 30 states. [2018-11-18 21:56:24,878 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 30 states. [2018-11-18 21:56:24,878 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 30 states. [2018-11-18 21:56:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:24,881 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-18 21:56:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-18 21:56:24,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:24,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:24,882 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 74 states. [2018-11-18 21:56:24,882 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 74 states. [2018-11-18 21:56:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:24,886 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-18 21:56:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-18 21:56:24,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:24,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:24,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:24,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 21:56:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-18 21:56:24,889 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-18 21:56:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:24,889 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-18 21:56:24,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 21:56:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 21:56:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 21:56:24,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:24,890 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-18 21:56:24,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:24,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1167298014, now seen corresponding path program 1 times [2018-11-18 21:56:24,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:24,891 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-18 21:56:24,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:24,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:25,025 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-18 21:56:25,042 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-18 21:56:25,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:25,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:25,054 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-18 21:56:25,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:56:25,058 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:25,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-18 21:56:25,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1194#true} is VALID [2018-11-18 21:56:25,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 21:56:25,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #144#return; {1194#true} is VALID [2018-11-18 21:56:25,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret16 := main(); {1194#true} is VALID [2018-11-18 21:56:25,072 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-18 21:56:25,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 21:56:25,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1194#true} is VALID [2018-11-18 21:56:25,073 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-18 21:56:25,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 21:56:25,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {1194#true} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1194#true} is VALID [2018-11-18 21:56:25,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 21:56:25,074 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-18 21:56:25,075 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-18 21:56:25,075 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-18 21:56:25,076 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-18 21:56:25,076 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-18 21:56:25,077 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-18 21:56:25,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-18 21:56:25,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {1195#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1195#false} is VALID [2018-11-18 21:56:25,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-18 21:56:25,079 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-18 21:56:25,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:25,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:25,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:56:25,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-18 21:56:25,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:25,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:56:25,104 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-18 21:56:25,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:56:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:56:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:56:25,105 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-11-18 21:56:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:25,799 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 21:56:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:56:25,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-18 21:56:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:56:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:56:25,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-18 21:56:25,900 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-18 21:56:25,902 INFO L225 Difference]: With dead ends: 48 [2018-11-18 21:56:25,902 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 21:56:25,903 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-18 21:56:25,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 21:56:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-18 21:56:25,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:25,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:25,928 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:25,928 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:25,931 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:25,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:25,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:25,932 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-18 21:56:25,932 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-18 21:56:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:25,934 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:25,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:25,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:25,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:25,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 21:56:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-18 21:56:25,936 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-18 21:56:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:25,936 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-18 21:56:25,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:56:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-18 21:56:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:56:25,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:25,938 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-18 21:56:25,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:25,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1449495770, now seen corresponding path program 1 times [2018-11-18 21:56:25,939 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:25,939 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-18 21:56:25,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:26,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:26,060 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-18 21:56:26,068 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-18 21:56:26,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,096 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-18 21:56:26,101 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-18 21:56:26,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 21:56:26,243 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-18 21:56:26,248 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-18 21:56:26,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,265 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-18 21:56:26,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-18 21:56:26,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:26,296 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-18 21:56:26,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 21:56:26,302 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:26,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1427#true} call ULTIMATE.init(); {1427#true} is VALID [2018-11-18 21:56:26,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1427#true} is VALID [2018-11-18 21:56:26,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {1427#true} assume true; {1427#true} is VALID [2018-11-18 21:56:26,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1427#true} {1427#true} #144#return; {1427#true} is VALID [2018-11-18 21:56:26,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {1427#true} call #t~ret16 := main(); {1427#true} is VALID [2018-11-18 21:56:26,322 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-18 21:56:26,322 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-18 21:56:26,323 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 !(0bv32 != #t~nondet1);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-18 21:56:26,324 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-18 21:56:26,325 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-18 21:56:26,332 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-18 21:56:26,333 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-18 21:56:26,333 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-18 21:56:26,334 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-18 21:56:26,334 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-18 21:56:26,335 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-18 21:56:26,335 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-18 21:56:26,336 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-18 21:56:26,337 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-18 21:56:26,338 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-18 21:56:26,339 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-18 21:56:26,339 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-18 21:56:26,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {1428#false} assume true; {1428#false} is VALID [2018-11-18 21:56:26,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {1428#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1428#false} is VALID [2018-11-18 21:56:26,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {1428#false} assume !false; {1428#false} is VALID [2018-11-18 21:56:26,343 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-18 21:56:26,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:26,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {1428#false} assume !false; {1428#false} is VALID [2018-11-18 21:56:26,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {1428#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1428#false} is VALID [2018-11-18 21:56:26,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {1428#false} assume true; {1428#false} is VALID [2018-11-18 21:56:26,615 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-18 21:56:26,629 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-18 21:56:26,635 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-18 21:56:26,635 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-18 21:56:26,636 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-18 21:56:26,639 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-18 21:56:26,640 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-18 21:56:26,640 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-18 21:56:26,641 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-18 21:56:26,641 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-18 21:56:26,642 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-18 21:56:26,642 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-18 21:56:26,643 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-18 21:56:26,644 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-18 21:56:26,645 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 !(0bv32 != #t~nondet1);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-18 21:56:26,646 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-18 21:56:26,649 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-18 21:56:26,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {1427#true} call #t~ret16 := main(); {1427#true} is VALID [2018-11-18 21:56:26,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1427#true} {1427#true} #144#return; {1427#true} is VALID [2018-11-18 21:56:26,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {1427#true} assume true; {1427#true} is VALID [2018-11-18 21:56:26,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {1427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1427#true} is VALID [2018-11-18 21:56:26,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {1427#true} call ULTIMATE.init(); {1427#true} is VALID [2018-11-18 21:56:26,653 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-18 21:56:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:56:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 21:56:26,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 21:56:26,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:26,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 21:56:26,712 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-18 21:56:26,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 21:56:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 21:56:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 21:56:26,713 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2018-11-18 21:56:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:28,149 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-18 21:56:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:56:28,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 21:56:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:56:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-18 21:56:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:56:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-18 21:56:28,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-18 21:56:28,292 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-18 21:56:28,293 INFO L225 Difference]: With dead ends: 62 [2018-11-18 21:56:28,294 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 21:56:28,294 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-18 21:56:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 21:56:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 21:56:28,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:28,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:28,353 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:28,353 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:28,356 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 21:56:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:28,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:28,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:28,357 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:28,357 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:28,359 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 21:56:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:28,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:28,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:28,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:28,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 21:56:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 21:56:28,361 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2018-11-18 21:56:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:28,362 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 21:56:28,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 21:56:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:56:28,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:28,363 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-18 21:56:28,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:28,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1709093407, now seen corresponding path program 1 times [2018-11-18 21:56:28,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:28,364 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-18 21:56:28,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:28,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:28,487 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-18 21:56:28,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:28,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:28,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:56:28,508 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:28,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:28,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:28,665 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-18 21:56:28,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:28,902 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-18 21:56:28,914 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-18 21:56:28,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,009 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-18 21:56:29,023 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-18 21:56:29,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,071 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-18 21:56:29,143 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-18 21:56:29,154 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-18 21:56:29,155 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,191 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-18 21:56:29,197 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-18 21:56:29,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,213 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:29,223 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-18 21:56:29,255 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-18 21:56:29,255 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-18 21:56:29,939 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:30,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:30,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:30,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:30,084 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-18 21:56:30,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:30,307 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-18 21:56:30,319 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-18 21:56:30,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,429 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-18 21:56:30,447 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-18 21:56:30,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,520 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-18 21:56:30,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:30,643 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-18 21:56:30,655 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-18 21:56:30,665 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,727 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-18 21:56:30,736 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-18 21:56:30,738 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,763 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:30,785 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-18 21:56:30,842 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-18 21:56:30,843 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:167, output treesize:117 [2018-11-18 21:56:30,960 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:31,471 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-18 21:56:31,485 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-18 21:56:31,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,536 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-18 21:56:31,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,585 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-18 21:56:31,585 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:71 [2018-11-18 21:56:31,596 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:31,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:31,905 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-18 21:56:31,926 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-18 21:56:31,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,956 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-18 21:56:31,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,977 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-18 21:56:31,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:31,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:32,047 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-18 21:56:32,057 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-18 21:56:32,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:32,084 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-18 21:56:32,086 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:32,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:32,119 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-18 21:56:32,119 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:163, output treesize:4 [2018-11-18 21:56:32,129 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:32,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2018-11-18 21:56:32,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {1772#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1772#true} is VALID [2018-11-18 21:56:32,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2018-11-18 21:56:32,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #144#return; {1772#true} is VALID [2018-11-18 21:56:32,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret16 := main(); {1772#true} is VALID [2018-11-18 21:56:32,154 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-18 21:56:32,154 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-18 21:56:32,157 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 !!(0bv32 != #t~nondet1);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-18 21:56:32,164 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 !(0bv32 != #t~nondet4);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-18 21:56:32,166 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-18 21:56:32,167 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 !(0bv32 != #t~nondet1);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-18 21:56:32,169 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-18 21:56:32,170 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-18 21:56:32,172 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-18 21:56:32,174 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-18 21:56:32,175 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-18 21:56:32,177 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-18 21:56:32,178 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-18 21:56:32,180 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-18 21:56:32,182 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-18 21:56:32,183 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-18 21:56:32,186 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-18 21:56:32,187 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-18 21:56:32,189 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-18 21:56:32,190 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-18 21:56:32,191 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-18 21:56:32,191 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-18 21:56:32,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2018-11-18 21:56:32,197 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-18 21:56:32,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:37,121 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 21:56:39,269 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-18 21:56:39,284 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-18 21:56:39,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:39,570 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-11-18 21:56:39,775 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-18 21:56:40,725 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-11-18 21:56:40,739 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-18 21:56:40,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,753 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 21:56:40,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:41,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:41,055 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-18 21:56:41,073 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:41,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:41,540 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-11-18 21:56:41,683 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-18 21:56:41,768 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-18 21:56:41,772 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:42,992 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-18 21:56:42,997 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:44,330 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-18 21:56:44,338 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:45,683 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-18 21:56:45,687 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:47,399 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-18 21:56:47,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:47,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:47,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:47,622 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-18 21:56:47,629 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:50,870 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:50,880 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:50,904 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-18 21:56:50,908 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:53,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:53,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:53,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:53,567 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-18 21:56:53,577 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:55,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:55,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:55,627 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-18 21:56:55,635 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:57,862 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-18 21:56:57,863 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:57,873 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-18 21:56:57,875 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:59,821 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-18 21:56:59,826 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:01,706 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-18 21:57:01,726 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:03,513 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-18 21:57:03,515 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:05,256 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-18 21:57:05,258 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:07,033 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-18 21:57:07,040 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:08,144 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-18 21:57:08,146 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:08,748 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-18 21:57:08,754 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:09,272 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-18 21:57:09,277 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:10,195 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-18 21:57:10,211 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:10,723 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-18 21:57:10,725 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:12,219 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-18 21:57:12,220 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:12,329 INFO L267 ElimStorePlain]: Start of recursive call 13: 26 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:57:12,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:12,491 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-18 21:57:12,692 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-18 21:57:12,697 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:17,626 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-18 21:57:17,648 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:23,260 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-18 21:57:23,262 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:23,268 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-18 21:57:23,271 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:27,869 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-18 21:57:27,872 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:27,883 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-18 21:57:27,885 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:32,425 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-18 21:57:32,427 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:32,438 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-18 21:57:32,440 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:36,326 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-18 21:57:36,329 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:36,343 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-18 21:57:36,347 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:39,084 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-18 21:57:39,088 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:39,099 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-18 21:57:39,105 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:41,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:41,673 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:41,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:41,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:41,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:41,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 309 [2018-11-18 21:57:41,855 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 8 xjuncts. [2018-11-18 21:57:42,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:42,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:42,773 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-11-18 21:57:42,776 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:44,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 95 [2018-11-18 21:57:44,182 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-11-18 21:57:44,670 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 99 treesize of output 93 [2018-11-18 21:57:44,672 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:46,007 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-18 21:57:46,009 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:46,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:46,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:46,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:46,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:47,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-11-18 21:57:47,014 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-11-18 21:57:50,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 229 [2018-11-18 21:57:50,121 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-11-18 21:57:52,509 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-18 21:57:52,515 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:52,837 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 33 treesize of output 27 [2018-11-18 21:57:52,839 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:53,170 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 27 treesize of output 30 [2018-11-18 21:57:53,177 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-11-18 21:57:53,337 INFO L267 ElimStorePlain]: Start of recursive call 31: 34 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:57:54,410 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,441 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-18 21:57:54,534 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 129 [2018-11-18 21:57:54,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,778 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:57:54,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 290 [2018-11-18 21:57:54,830 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-18 21:57:58,049 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 100 treesize of output 94 [2018-11-18 21:57:58,051 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:00,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:00,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:00,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:00,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:00,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:01,029 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 224 [2018-11-18 21:58:01,034 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:04,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:04,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:04,228 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:04,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2018-11-18 21:58:04,231 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:07,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 164 [2018-11-18 21:58:07,147 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:10,201 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,211 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,230 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:10,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 290 [2018-11-18 21:58:10,290 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:12,861 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 100 treesize of output 94 [2018-11-18 21:58:12,866 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:15,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:15,270 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:15,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:15,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:15,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:15,343 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 224 [2018-11-18 21:58:15,347 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-11-18 21:58:17,742 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:22,006 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2018-11-18 21:58:22,008 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:26,033 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 91 treesize of output 85 [2018-11-18 21:58:26,035 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:26,042 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 29 treesize of output 23 [2018-11-18 21:58:26,047 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:27,993 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 106 treesize of output 100 [2018-11-18 21:58:27,995 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:31,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 161 [2018-11-18 21:58:31,887 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:33,803 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 0 case distinctions, treesize of input 26 treesize of output 14 [2018-11-18 21:58:33,805 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:33,818 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 0 case distinctions, treesize of input 88 treesize of output 76 [2018-11-18 21:58:33,819 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:36,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:36,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:36,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:36,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 157 [2018-11-18 21:58:36,114 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:37,196 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 91 treesize of output 85 [2018-11-18 21:58:37,200 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:38,256 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 85 treesize of output 79 [2018-11-18 21:58:38,258 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:39,278 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 103 treesize of output 97 [2018-11-18 21:58:39,280 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:40,201 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 88 [2018-11-18 21:58:40,204 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:41,044 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 103 treesize of output 97 [2018-11-18 21:58:41,046 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:41,888 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 0 case distinctions, treesize of input 97 treesize of output 85 [2018-11-18 21:58:41,891 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:42,611 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 94 treesize of output 88 [2018-11-18 21:58:42,614 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:43,372 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 100 treesize of output 94 [2018-11-18 21:58:43,375 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:44,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:44,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:44,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:44,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:44,154 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:44,212 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 218 [2018-11-18 21:58:44,215 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:44,790 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2018-11-18 21:58:44,792 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:45,738 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 22 treesize of output 16 [2018-11-18 21:58:45,740 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:46,194 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:46,195 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:46,196 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 25 treesize of output 19 [2018-11-18 21:58:46,197 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:46,640 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 76 [2018-11-18 21:58:46,643 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:47,218 INFO L267 ElimStorePlain]: Start of recursive call 54: 34 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-18 21:58:47,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:47,946 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-18 21:58:48,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 103 treesize of output 162 [2018-11-18 21:58:48,156 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8