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-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:17:53,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:17:53,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:17:53,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:17:53,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:17:53,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:17:53,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:17:53,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:17:53,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:17:53,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:17:53,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:17:53,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:17:53,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:17:53,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:17:53,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:17:53,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:17:53,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:17:53,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:17:53,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:17:53,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:17:53,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:17:53,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:17:53,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:17:53,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:17:53,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:17:53,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:17:53,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:17:53,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:17:53,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:17:53,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:17:53,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:17:53,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:17:53,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:17:53,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:17:53,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:17:53,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:17:53,785 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:17:53,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:17:53,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:17:53,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:17:53,805 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:17:53,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:17:53,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:17:53,807 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:17:53,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:17:53,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:17:53,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:17:53,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:17:53,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:17:53,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:17:53,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:17:53,810 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:17:53,810 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:17:53,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:17:53,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:17:53,810 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:17:53,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:17:53,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:17:53,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:17:53,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:17:53,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:17:53,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:17:53,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:17:53,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:17:53,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:17:53,814 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:17:53,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:17:53,814 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:17:53,814 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:17:53,815 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:17:53,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:17:53,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:17:53,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:17:53,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:17:53,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:17:53,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:53,969 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac7d2291/c5ae5c6f3ee44ce092211ff24a33deb5/FLAG576a7a1ea [2018-11-14 18:17:54,449 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:17:54,449 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:54,463 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac7d2291/c5ae5c6f3ee44ce092211ff24a33deb5/FLAG576a7a1ea [2018-11-14 18:17:54,477 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac7d2291/c5ae5c6f3ee44ce092211ff24a33deb5 [2018-11-14 18:17:54,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:17:54,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:17:54,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:54,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:17:54,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:17:54,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:54" (1/1) ... [2018-11-14 18:17:54,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e167752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:54, skipping insertion in model container [2018-11-14 18:17:54,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:54" (1/1) ... [2018-11-14 18:17:54,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:17:54,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:17:55,046 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:55,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:17:55,142 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:55,285 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:17:55,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55 WrapperNode [2018-11-14 18:17:55,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:55,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:17:55,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:17:55,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:17:55,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... [2018-11-14 18:17:55,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:17:55,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:17:55,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:17:55,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:17:55,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:17:55,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:17:55,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:17:55,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:17:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:17:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:17:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:17:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:17:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:17:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:17:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:17:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:17:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:17:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:17:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:17:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:17:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:17:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:17:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:17:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:17:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:17:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:17:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:17:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:17:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:17:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:17:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:17:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:17:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:17:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:17:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:17:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:17:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:17:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:17:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:17:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:17:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:17:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:17:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:17:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:17:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:17:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:17:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:17:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:17:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:17:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:17:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:17:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:17:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:17:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:17:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:17:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:17:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:17:56,815 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:17:56,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:56 BoogieIcfgContainer [2018-11-14 18:17:56,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:17:56,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:17:56,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:17:56,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:17:56,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:17:54" (1/3) ... [2018-11-14 18:17:56,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5756cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:56, skipping insertion in model container [2018-11-14 18:17:56,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:55" (2/3) ... [2018-11-14 18:17:56,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5756cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:56, skipping insertion in model container [2018-11-14 18:17:56,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:56" (3/3) ... [2018-11-14 18:17:56,827 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:56,842 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:17:56,856 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-14 18:17:56,886 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-14 18:17:56,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:17:56,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:17:56,923 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:17:56,923 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:17:56,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:17:56,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:17:56,925 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:17:56,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:17:56,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:17:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-11-14 18:17:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:17:56,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:56,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:56,966 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:56,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2052628517, now seen corresponding path program 1 times [2018-11-14 18:17:56,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:56,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:57,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:57,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {77#true} is VALID [2018-11-14 18:17:57,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {77#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {77#true} is VALID [2018-11-14 18:17:57,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {77#true} assume true; {77#true} is VALID [2018-11-14 18:17:57,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {77#true} {77#true} #264#return; {77#true} is VALID [2018-11-14 18:17:57,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {77#true} call #t~ret27 := main(); {77#true} is VALID [2018-11-14 18:17:57,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {77#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {77#true} is VALID [2018-11-14 18:17:57,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {77#true} assume !true; {78#false} is VALID [2018-11-14 18:17:57,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {78#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {78#false} is VALID [2018-11-14 18:17:57,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {78#false} assume true; {78#false} is VALID [2018-11-14 18:17:57,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {78#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {78#false} is VALID [2018-11-14 18:17:57,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {78#false} assume !false; {78#false} is VALID [2018-11-14 18:17:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:57,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:57,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:17:57,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:57,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:57,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:17:57,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:17:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:17:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:17:57,278 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2018-11-14 18:17:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:57,670 INFO L93 Difference]: Finished difference Result 138 states and 208 transitions. [2018-11-14 18:17:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:17:57,671 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2018-11-14 18:17:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2018-11-14 18:17:57,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 208 transitions. [2018-11-14 18:17:58,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:58,422 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:17:58,423 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:17:58,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:17:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:17:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-14 18:17:58,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:58,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-14 18:17:58,523 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 18:17:58,523 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 18:17:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:58,530 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 18:17:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:17:58,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:58,532 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 18:17:58,532 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 18:17:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:58,539 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 18:17:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:17:58,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:58,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:58,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:58,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:17:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-14 18:17:58,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 11 [2018-11-14 18:17:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:58,551 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-14 18:17:58,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:17:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:17:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:17:58,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:58,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:58,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:58,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1382353853, now seen corresponding path program 1 times [2018-11-14 18:17:58,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:58,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:58,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:58,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-14 18:17:58,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {480#true} is VALID [2018-11-14 18:17:58,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-14 18:17:58,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #264#return; {480#true} is VALID [2018-11-14 18:17:58,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret27 := main(); {480#true} is VALID [2018-11-14 18:17:58,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {480#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {500#(= (_ bv0 32) main_~marked~0)} is VALID [2018-11-14 18:17:58,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {500#(= (_ bv0 32) main_~marked~0)} assume true; {500#(= (_ bv0 32) main_~marked~0)} is VALID [2018-11-14 18:17:58,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {500#(= (_ bv0 32) main_~marked~0)} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {481#false} is VALID [2018-11-14 18:17:58,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {481#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {481#false} is VALID [2018-11-14 18:17:58,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#false} assume true; {481#false} is VALID [2018-11-14 18:17:58,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {481#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {481#false} is VALID [2018-11-14 18:17:58,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-14 18:17:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:58,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:17:58,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 18:17:58,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:58,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:17:58,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:17:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:17:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:58,717 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 3 states. [2018-11-14 18:17:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:59,166 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-14 18:17:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:17:59,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 18:17:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-14 18:17:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-14 18:17:59,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-14 18:17:59,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:59,530 INFO L225 Difference]: With dead ends: 132 [2018-11-14 18:17:59,530 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 18:17:59,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 18:17:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-14 18:17:59,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:59,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-14 18:17:59,575 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-14 18:17:59,575 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-14 18:17:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:59,579 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-14 18:17:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-14 18:17:59,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:59,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:59,581 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-14 18:17:59,581 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-14 18:17:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:59,585 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-14 18:17:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-14 18:17:59,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:59,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:59,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:59,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:17:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-14 18:17:59,593 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 12 [2018-11-14 18:17:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:59,593 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-14 18:17:59,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:17:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-14 18:17:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:17:59,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:59,595 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:59,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:59,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash 738750319, now seen corresponding path program 1 times [2018-11-14 18:17:59,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:59,596 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:59,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:59,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-14 18:17:59,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {898#true} is VALID [2018-11-14 18:17:59,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-14 18:17:59,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #264#return; {898#true} is VALID [2018-11-14 18:17:59,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret27 := main(); {898#true} is VALID [2018-11-14 18:17:59,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume true; {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume true; {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {918#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-14 18:17:59,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {918#(not (= (_ bv0 32) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {940#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:59,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {940#(not (= (_ bv0 32) main_~x~0.base))} assume true; {940#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:59,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {940#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {899#false} is VALID [2018-11-14 18:17:59,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-14 18:17:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:17:59,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:59,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:59,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:17:59,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-14 18:17:59,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:59,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:17:59,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:59,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:17:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:17:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:17:59,784 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 4 states. [2018-11-14 18:18:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:00,366 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2018-11-14 18:18:00,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:18:00,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-14 18:18:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:18:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2018-11-14 18:18:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:18:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2018-11-14 18:18:00,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 125 transitions. [2018-11-14 18:18:00,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:00,639 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:18:00,640 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 18:18:00,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-14 18:18:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 18:18:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2018-11-14 18:18:00,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:00,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 68 states. [2018-11-14 18:18:00,681 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 68 states. [2018-11-14 18:18:00,681 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 68 states. [2018-11-14 18:18:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:00,686 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2018-11-14 18:18:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-11-14 18:18:00,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:00,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:00,688 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 112 states. [2018-11-14 18:18:00,688 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 112 states. [2018-11-14 18:18:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:00,693 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2018-11-14 18:18:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-11-14 18:18:00,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:00,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:00,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:00,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:18:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-14 18:18:00,699 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 16 [2018-11-14 18:18:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:00,699 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-14 18:18:00,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:18:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-14 18:18:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:18:00,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:00,701 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:00,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:00,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1345771810, now seen corresponding path program 1 times [2018-11-14 18:18:00,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:00,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:00,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:18:00,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:18:01,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:18:01,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,052 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-14 18:18:01,068 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:01,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:01,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:01,168 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 13 treesize of output 4 [2018-11-14 18:18:01,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-14 18:18:01,290 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 23 treesize of output 24 [2018-11-14 18:18:01,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:18:01,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:01,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-14 18:18:01,362 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:01,542 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 18:18:02,047 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 24 treesize of output 22 [2018-11-14 18:18:02,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:18:02,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 18:18:02,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,101 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-14 18:18:02,106 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:02,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 18:18:02,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1388#true} is VALID [2018-11-14 18:18:02,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 18:18:02,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #264#return; {1388#true} is VALID [2018-11-14 18:18:02,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret27 := main(); {1388#true} is VALID [2018-11-14 18:18:02,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {1408#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume true; {1408#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {1415#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {1415#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {1415#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {1415#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} assume true; {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:02,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {1422#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (main_~x~0.base (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume true; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume true; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} ~marked~0 := 0bv32; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume true; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);#t~short8 := #t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);#t~short8 := #t~mem7 == 0bv32; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume !!#t~short8;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} is VALID [2018-11-14 18:18:02,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {1432#(and (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (v_subst_2 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_subst_2) (bvadd v_subst_1 (_ bv4 32)))) (not (= v_subst_2 main_~x~0.base)))))} assume true;call #t~mem9 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1460#(= (_ bv0 32) |main_#t~mem9|)} is VALID [2018-11-14 18:18:02,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {1460#(= (_ bv0 32) |main_#t~mem9|)} assume !(#t~mem9 == 0bv32);havoc #t~mem9; {1389#false} is VALID [2018-11-14 18:18:02,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 18:18:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:02,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:02,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 18:18:02,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1460#(= (_ bv0 32) |main_#t~mem9|)} assume !(#t~mem9 == 0bv32);havoc #t~mem9; {1389#false} is VALID [2018-11-14 18:18:02,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume true;call #t~mem9 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1460#(= (_ bv0 32) |main_#t~mem9|)} is VALID [2018-11-14 18:18:02,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume !!#t~short8;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);#t~short8 := #t~mem7 == 0bv32; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);#t~short8 := #t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume true; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} ~marked~0 := 0bv32; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume true; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume true; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1473#(= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:02,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 18:18:02,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} assume true; {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 18:18:02,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {1511#(forall ((main_~x~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1501#(= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 18:18:02,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {1511#(forall ((main_~x~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {1511#(forall ((main_~x~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:02,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {1518#(forall ((main_~x~0.offset (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= (_ bv0 32) (select (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {1511#(forall ((main_~x~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:02,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {1518#(forall ((main_~x~0.offset (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= (_ bv0 32) (select (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))))} assume true; {1518#(forall ((main_~x~0.offset (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= (_ bv0 32) (select (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:18:02,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {1518#(forall ((main_~x~0.offset (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= (_ bv0 32) (select (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:18:02,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret27 := main(); {1388#true} is VALID [2018-11-14 18:18:02,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #264#return; {1388#true} is VALID [2018-11-14 18:18:02,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 18:18:02,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1388#true} is VALID [2018-11-14 18:18:02,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 18:18:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:02,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:02,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 18:18:02,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-14 18:18:02,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:02,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:18:02,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:02,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:18:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:18:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:18:02,727 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 11 states. [2018-11-14 18:18:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:06,617 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-11-14 18:18:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:18:06,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-14 18:18:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:18:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-14 18:18:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:18:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-14 18:18:06,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 128 transitions. [2018-11-14 18:18:07,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:07,130 INFO L225 Difference]: With dead ends: 113 [2018-11-14 18:18:07,131 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 18:18:07,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:18:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 18:18:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2018-11-14 18:18:07,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:07,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 74 states. [2018-11-14 18:18:07,259 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 74 states. [2018-11-14 18:18:07,259 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 74 states. [2018-11-14 18:18:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:07,263 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2018-11-14 18:18:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2018-11-14 18:18:07,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:07,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:07,265 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 111 states. [2018-11-14 18:18:07,265 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 111 states. [2018-11-14 18:18:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:07,269 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2018-11-14 18:18:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2018-11-14 18:18:07,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:07,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:07,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:07,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:18:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-11-14 18:18:07,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 24 [2018-11-14 18:18:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:07,274 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-11-14 18:18:07,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:18:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-11-14 18:18:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:18:07,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:07,275 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:07,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:07,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 536374958, now seen corresponding path program 1 times [2018-11-14 18:18:07,276 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:07,276 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:07,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:07,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:07,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:18:07,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-14 18:18:07,436 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:07,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,534 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 13 treesize of output 4 [2018-11-14 18:18:07,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:07,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:07,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:07,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:07,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:07,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:07,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:07,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:07,980 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,991 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:07,998 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,028 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:73, output treesize:39 [2018-11-14 18:18:08,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:08,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-14 18:18:08,269 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 12 treesize of output 11 [2018-11-14 18:18:08,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:52 [2018-11-14 18:18:08,567 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 24 [2018-11-14 18:18:08,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:18:08,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,611 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 40 treesize of output 28 [2018-11-14 18:18:08,626 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 23 treesize of output 14 [2018-11-14 18:18:08,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:13 [2018-11-14 18:18:08,656 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:08,787 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 17 treesize of output 13 [2018-11-14 18:18:08,795 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 13 treesize of output 5 [2018-11-14 18:18:08,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:18:08,802 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:08,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {1999#true} call ULTIMATE.init(); {1999#true} is VALID [2018-11-14 18:18:08,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {1999#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1999#true} is VALID [2018-11-14 18:18:08,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-14 18:18:08,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1999#true} {1999#true} #264#return; {1999#true} is VALID [2018-11-14 18:18:08,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {1999#true} call #t~ret27 := main(); {1999#true} is VALID [2018-11-14 18:18:08,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {1999#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {2019#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:18:08,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {2019#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume true; {2019#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:18:08,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {2019#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2026#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:08,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {2026#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {2026#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:08,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {2026#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:08,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:08,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:08,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {2033#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume true; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume true; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} ~marked~0 := 0bv32; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume true; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);#t~short8 := #t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);#t~short8 := #t~mem7 == 0bv32; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume !#t~short8;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume true; {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {2043#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (_ bv0 32)))} assume !!((#t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32) && #t~nondet12 != 0bv32);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2077#(and (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~x~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:08,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2077#(and (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~x~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume true;call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2081#(= (_ bv1 32) |main_#t~mem14|)} is VALID [2018-11-14 18:18:08,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {2081#(= (_ bv1 32) |main_#t~mem14|)} assume !(#t~mem14 == 1bv32);havoc #t~mem14; {2000#false} is VALID [2018-11-14 18:18:08,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {2000#false} assume !false; {2000#false} is VALID [2018-11-14 18:18:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:08,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:09,286 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 13 [2018-11-14 18:18:09,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:18:09,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:09,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2018-11-14 18:18:09,328 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:09,599 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 38 treesize of output 31 [2018-11-14 18:18:09,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:18:09,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-14 18:18:09,753 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 9 [2018-11-14 18:18:09,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,784 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 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-14 18:18:09,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-14 18:18:09,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:09,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:18:09,942 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 38 treesize of output 31 [2018-11-14 18:18:10,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:18:10,009 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-14 18:18:10,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-14 18:18:10,118 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,147 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 10 treesize of output 3 [2018-11-14 18:18:10,148 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,170 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 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-14 18:18:10,172 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,180 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:10,184 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 17 treesize of output 15 [2018-11-14 18:18:10,189 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 6 treesize of output 1 [2018-11-14 18:18:10,194 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,200 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-14 18:18:10,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-14 18:18:10,362 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:77, output treesize:119 [2018-11-14 18:18:10,402 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:10,623 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2018-11-14 18:18:10,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {2000#false} assume !false; {2000#false} is VALID [2018-11-14 18:18:10,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {2081#(= (_ bv1 32) |main_#t~mem14|)} assume !(#t~mem14 == 1bv32);havoc #t~mem14; {2000#false} is VALID [2018-11-14 18:18:10,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {2094#(= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} assume true;call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2081#(= (_ bv1 32) |main_#t~mem14|)} is VALID [2018-11-14 18:18:10,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !!((#t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32) && #t~nondet12 != 0bv32);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2094#(= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:18:10,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume true; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !#t~short8;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);#t~short8 := #t~mem7 == 0bv32; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);#t~short8 := #t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume true; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} ~marked~0 := 0bv32; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume true; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume true; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2098#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume true; {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {2142#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2132#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:10,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {2142#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {2142#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:18:10,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {2149#(and (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= main_~head~0.base v_prenex_7)))) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (not (= (select |#valid| v_prenex_8) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (= main_~head~0.base v_prenex_1))) (= main_~x~0.offset main_~head~0.offset)))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2142#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:18:10,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {2149#(and (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= main_~head~0.base v_prenex_7)))) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (not (= (select |#valid| v_prenex_8) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (= main_~head~0.base v_prenex_1))) (= main_~x~0.offset main_~head~0.offset)))} assume true; {2149#(and (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= main_~head~0.base v_prenex_7)))) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (not (= (select |#valid| v_prenex_8) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (= main_~head~0.base v_prenex_1))) (= main_~x~0.offset main_~head~0.offset)))} is VALID [2018-11-14 18:18:10,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {1999#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {2149#(and (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= main_~head~0.base v_prenex_7)))) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (not (= (select |#valid| v_prenex_8) (_ bv0 1)))) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (= main_~head~0.base v_prenex_1))) (= main_~x~0.offset main_~head~0.offset)))} is VALID [2018-11-14 18:18:10,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {1999#true} call #t~ret27 := main(); {1999#true} is VALID [2018-11-14 18:18:10,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1999#true} {1999#true} #264#return; {1999#true} is VALID [2018-11-14 18:18:10,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-14 18:18:10,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {1999#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1999#true} is VALID [2018-11-14 18:18:10,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {1999#true} call ULTIMATE.init(); {1999#true} is VALID [2018-11-14 18:18:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-14 18:18:10,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-14 18:18:10,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:10,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:18:10,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:10,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:18:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:18:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:18:10,851 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 13 states. [2018-11-14 18:18:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:17,149 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2018-11-14 18:18:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:18:17,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-14 18:18:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:18:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2018-11-14 18:18:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:18:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2018-11-14 18:18:17,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 153 transitions. [2018-11-14 18:18:17,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:17,452 INFO L225 Difference]: With dead ends: 140 [2018-11-14 18:18:17,452 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 18:18:17,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:18:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 18:18:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 94. [2018-11-14 18:18:17,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:17,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 94 states. [2018-11-14 18:18:17,710 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 94 states. [2018-11-14 18:18:17,711 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 94 states. [2018-11-14 18:18:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:17,716 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-11-14 18:18:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2018-11-14 18:18:17,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:17,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:17,717 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 138 states. [2018-11-14 18:18:17,717 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 138 states. [2018-11-14 18:18:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:17,722 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-11-14 18:18:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2018-11-14 18:18:17,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:17,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:17,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:17,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:18:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-11-14 18:18:17,727 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-11-14 18:18:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-11-14 18:18:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:18:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-11-14 18:18:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:18:17,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:17,728 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:17,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:17,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash -704225854, now seen corresponding path program 1 times [2018-11-14 18:18:17,729 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:17,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:17,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:17,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:18:17,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:17,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:17,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-14 18:18:17,909 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:17,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:17,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-14 18:18:18,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:18,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:18,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:18,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:18,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:18,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:18,477 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:18,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:18,515 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,528 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,567 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2018-11-14 18:18:20,580 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:20,697 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-11-14 18:18:20,738 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 14 treesize of output 13 [2018-11-14 18:18:20,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:20,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:64 [2018-11-14 18:18:21,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:21,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:21,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:21,285 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-14 18:18:21,286 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 24 treesize of output 21 [2018-11-14 18:18:21,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:18:21,634 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 62 treesize of output 49 [2018-11-14 18:18:21,647 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 23 treesize of output 15 [2018-11-14 18:18:21,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-14 18:18:21,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:21,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:21,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,051 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 93 treesize of output 79 [2018-11-14 18:18:22,067 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 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-14 18:18:22,070 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,138 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 53 treesize of output 73 [2018-11-14 18:18:22,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:22,157 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,187 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,247 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:164, output treesize:73 [2018-11-14 18:18:22,393 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:22,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 57 [2018-11-14 18:18:22,556 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 30 treesize of output 36 [2018-11-14 18:18:22,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:118, output treesize:90 [2018-11-14 18:18:22,864 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-14 18:18:22,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:22,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-14 18:18:22,948 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 12 treesize of output 15 [2018-11-14 18:18:22,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,974 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 1 [2018-11-14 18:18:22,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:22,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:23,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:23,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:223, output treesize:81 [2018-11-14 18:18:23,032 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:23,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {2738#true} call ULTIMATE.init(); {2738#true} is VALID [2018-11-14 18:18:23,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {2738#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2738#true} is VALID [2018-11-14 18:18:23,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {2738#true} assume true; {2738#true} is VALID [2018-11-14 18:18:23,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2738#true} {2738#true} #264#return; {2738#true} is VALID [2018-11-14 18:18:23,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {2738#true} call #t~ret27 := main(); {2738#true} is VALID [2018-11-14 18:18:23,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {2738#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0bv32; {2758#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:18:23,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {2758#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume true; {2758#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:18:23,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {2758#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2765#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:23,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {2765#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {2765#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:23,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {2765#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume !(~marked~0 != 0bv32);call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2772#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:23,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {2772#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume true; {2772#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:18:23,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {2772#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset)))} assume !!(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2779#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:23,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {2779#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume #t~nondet4 != 0bv32;havoc #t~nondet4;~marked~0 := 1bv32; {2779#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:23,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {2779#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume ~marked~0 != 0bv32;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:23,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:23,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(#t~nondet1 != 0bv32 || ~marked~0 == 0bv32);havoc #t~nondet1; {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:18:23,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} assume true; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} assume true; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} ~marked~0 := 0bv32; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} assume true; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);#t~short8 := #t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32; {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:23,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv0 32)))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);#t~short8 := #t~mem7 == 0bv32; {2818#(and |main_#t~short8| (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))))} is VALID [2018-11-14 18:18:23,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {2818#(and |main_#t~short8| (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv0 32))))} assume !#t~short8;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {2739#false} is VALID [2018-11-14 18:18:23,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {2739#false} assume true; {2739#false} is VALID [2018-11-14 18:18:23,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {2739#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {2739#false} is VALID [2018-11-14 18:18:23,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {2739#false} assume !!((#t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32) && #t~nondet12 != 0bv32);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2739#false} is VALID [2018-11-14 18:18:23,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {2739#false} assume true;call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2739#false} is VALID [2018-11-14 18:18:23,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {2739#false} assume !(#t~mem14 == 1bv32);havoc #t~mem14; {2739#false} is VALID [2018-11-14 18:18:23,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {2739#false} assume !false; {2739#false} is VALID [2018-11-14 18:18:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:23,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:35,659 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-14 18:18:35,750 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 131 treesize of output 122 [2018-11-14 18:18:35,892 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-14 18:18:35,903 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 11 treesize of output 10 [2018-11-14 18:18:35,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,093 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 1 case distinctions, treesize of input 76 treesize of output 80 [2018-11-14 18:18:36,109 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 75 treesize of output 67 [2018-11-14 18:18:36,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 35 [2018-11-14 18:18:36,209 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,279 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 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-14 18:18:36,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:36,310 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 75 treesize of output 73 [2018-11-14 18:18:36,320 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 8 treesize of output 1 [2018-11-14 18:18:36,322 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:36,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:18:36,791 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 131 treesize of output 122 [2018-11-14 18:18:36,989 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-14 18:18:37,004 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 11 treesize of output 10 [2018-11-14 18:18:37,005 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2018-11-14 18:18:37,188 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 75 treesize of output 67 [2018-11-14 18:18:37,193 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,317 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 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-14 18:18:37,322 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 35 [2018-11-14 18:18:37,388 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,428 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:37,491 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:37,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-11-14 18:18:37,815 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:263, output treesize:387 [2018-11-14 18:18:39,830 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:41,887 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_17 (_ BitVec 32))) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset (_ bv0 32))))) (store .cse0 v_prenex_17 (store (select .cse0 v_prenex_17) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset) c_main_~x~0.offset) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset v_prenex_17)))) (store .cse1 v_prenex_17 (store (select .cse1 v_prenex_17) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)) (not (= (select |c_#valid| v_prenex_17) (_ bv0 1))))) (forall ((v_prenex_15 (_ BitVec 32))) (let ((.cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset (_ bv0 32))))) (store .cse3 v_prenex_15 (store (select .cse3 v_prenex_15) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset))) (or (not (= (select |c_#valid| v_prenex_15) (_ bv0 1))) (= (_ bv0 32) .cse2) (= .cse2 c_main_~x~0.offset)))) (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset (_ bv0 32))))) (store .cse4 |v_main_#t~malloc2.base_4| (store (select .cse4 |v_main_#t~malloc2.base_4|) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset |v_main_#t~malloc2.base_4|)))) (store .cse5 |v_main_#t~malloc2.base_4| (store (select .cse5 |v_main_#t~malloc2.base_4|) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset) c_main_~x~0.base) (not (= (select |c_#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1))))) (forall ((v_prenex_16 (_ BitVec 32))) (let ((.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset v_prenex_16)))) (store .cse7 v_prenex_16 (store (select .cse7 v_prenex_16) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset))) (or (= .cse6 (_ bv0 32)) (= .cse6 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_16) (_ bv0 1)))))) (forall ((v_prenex_11 (_ BitVec 32))) (let ((.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset v_prenex_11)))) (store .cse10 v_prenex_11 (store (select .cse10 v_prenex_11) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset))) (or (not (= .cse8 v_prenex_11)) (= .cse8 (_ bv0 32)) (not (= (select |c_#valid| v_prenex_11) (_ bv0 1))) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset (_ bv0 32))))) (store .cse9 v_prenex_11 (store (select .cse9 v_prenex_11) (_ bv0 32) (_ bv0 32)))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32))))))) is different from false [2018-11-14 18:18:44,128 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 142 treesize of output 119 [2018-11-14 18:18:44,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:18:44,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:44,355 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 40 treesize of output 50 [2018-11-14 18:18:44,605 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:18:44,623 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 30 treesize of output 31 [2018-11-14 18:18:44,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:44,640 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 30 treesize of output 31 [2018-11-14 18:18:44,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:44,920 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 28 treesize of output 27 [2018-11-14 18:18:44,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2018-11-14 18:18:45,769 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-11-14 18:18:45,831 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 24 treesize of output 12 [2018-11-14 18:18:45,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,530 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-14 18:18:46,533 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:47,547 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 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-14 18:18:47,549 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:47,868 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:18:47,870 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:48,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:18:48,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 42 [2018-11-14 18:18:48,517 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 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:18:48,520 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:49,017 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 24 treesize of output 12 [2018-11-14 18:18:49,020 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:49,424 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 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-14 18:18:49,429 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:49,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-14 18:18:49,784 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:50,191 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 16 treesize of output 10 [2018-11-14 18:18:50,194 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:50,594 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 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-14 18:18:50,596 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:50,850 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-14 18:18:50,852 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:18:51,254 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,375 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:18:51,377 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,509 INFO L267 ElimStorePlain]: Start of recursive call 13: 11 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:18:51,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:18:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:19:00,585 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 142 treesize of output 119 [2018-11-14 18:19:00,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:00,649 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:01,000 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-11-14 18:19:01,225 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 40 treesize of output 50 [2018-11-14 18:19:01,546 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:01,556 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 31 treesize of output 30 [2018-11-14 18:19:01,560 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:01,567 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 31 treesize of output 30 [2018-11-14 18:19:01,570 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:01,972 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 30 treesize of output 31 [2018-11-14 18:19:01,975 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:01,989 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 30 treesize of output 31 [2018-11-14 18:19:01,992 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-14 18:19:02,351 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 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-14 18:19:02,354 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,490 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 21 treesize of output 19 [2018-11-14 18:19:02,493 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:19:02,591 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,786 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:19:02,788 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,847 INFO L267 ElimStorePlain]: Start of recursive call 30: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-14 18:19:02,937 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 18:19:02,940 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,147 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 24 treesize of output 18 [2018-11-14 18:19:03,181 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,374 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 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-14 18:19:03,380 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:19:03,618 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,714 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-14 18:19:03,737 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,798 INFO L267 ElimStorePlain]: Start of recursive call 35: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:04,091 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 1 case distinctions, treesize of input 27 treesize of output 29 [2018-11-14 18:19:04,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-14 18:19:04,110 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,197 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 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:19:04,200 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,276 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 19 treesize of output 7 [2018-11-14 18:19:04,278 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,326 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:04,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-11-14 18:19:04,386 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 24 treesize of output 12 [2018-11-14 18:19:04,390 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,488 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 12 treesize of output 10 [2018-11-14 18:19:04,490 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,558 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 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-14 18:19:04,561 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:04,616 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:04,739 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:04,794 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:11,757 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 85 treesize of output 62 [2018-11-14 18:19:11,767 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 9 treesize of output 8 [2018-11-14 18:19:11,769 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,898 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 40 treesize of output 50 [2018-11-14 18:19:12,215 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:12,226 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 31 treesize of output 30 [2018-11-14 18:19:12,228 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,233 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 31 treesize of output 30 [2018-11-14 18:19:12,234 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,424 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 27 treesize of output 36 [2018-11-14 18:19:12,428 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:12,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-11-14 18:19:12,640 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 23 treesize of output 17 [2018-11-14 18:19:12,641 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,689 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 17 treesize of output 15 [2018-11-14 18:19:12,692 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,736 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 20 treesize of output 15 [2018-11-14 18:19:12,742 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,763 INFO L267 ElimStorePlain]: Start of recursive call 55: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-14 18:19:12,798 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,800 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 25 treesize of output 19 [2018-11-14 18:19:12,801 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,854 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 16 treesize of output 14 [2018-11-14 18:19:12,856 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,904 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 18:19:12,910 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,929 INFO L267 ElimStorePlain]: Start of recursive call 59: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:13,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2018-11-14 18:19:13,523 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-14 18:19:13,535 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:13,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:13,542 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-14 18:19:13,544 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:13,768 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 18 treesize of output 13 [2018-11-14 18:19:13,770 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:13,859 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 15 treesize of output 10 [2018-11-14 18:19:13,862 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:13,923 INFO L267 ElimStorePlain]: Start of recursive call 63: 10 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:13,929 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:13,983 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,000 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 85 treesize of output 62 [2018-11-14 18:19:14,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:14,009 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,127 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-11-14 18:19:14,395 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:14,402 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 31 treesize of output 30 [2018-11-14 18:19:14,404 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,412 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 31 treesize of output 30 [2018-11-14 18:19:14,413 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:14,640 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 27 treesize of output 36 [2018-11-14 18:19:14,643 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:14,783 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 24 treesize of output 23 [2018-11-14 18:19:14,791 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 5 treesize of output 3 [2018-11-14 18:19:14,792 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,863 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 6 treesize of output 1 [2018-11-14 18:19:14,864 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,874 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,886 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 25 [2018-11-14 18:19:14,903 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 5 treesize of output 3 [2018-11-14 18:19:14,904 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:14,929 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:14,930 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 13 treesize of output 7 [2018-11-14 18:19:14,931 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:14,942 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:15,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 38 [2018-11-14 18:19:15,247 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-14 18:19:15,272 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 21 treesize of output 19 [2018-11-14 18:19:15,274 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:15,418 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 15 treesize of output 15 [2018-11-14 18:19:15,420 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:15,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:15,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:15,555 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-14 18:19:15,563 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:15,675 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 13 treesize of output 7 [2018-11-14 18:19:15,676 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:15,768 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 21 treesize of output 19 [2018-11-14 18:19:15,770 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:15,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:15,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:15,848 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 16 treesize of output 10 [2018-11-14 18:19:15,860 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:15,904 INFO L267 ElimStorePlain]: Start of recursive call 79: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:16,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-11-14 18:19:16,025 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 27 treesize of output 21 [2018-11-14 18:19:16,026 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,149 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 18 treesize of output 12 [2018-11-14 18:19:16,151 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,259 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 21 treesize of output 19 [2018-11-14 18:19:16,261 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,399 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 12 treesize of output 10 [2018-11-14 18:19:16,401 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,498 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:16,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:16,514 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-14 18:19:16,518 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:16,619 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:16,619 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:16,620 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 16 treesize of output 10 [2018-11-14 18:19:16,621 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:19:16,699 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,775 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:19:16,777 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,808 INFO L267 ElimStorePlain]: Start of recursive call 86: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:16,812 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,828 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,842 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 85 treesize of output 62 [2018-11-14 18:19:16,851 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 9 treesize of output 8 [2018-11-14 18:19:16,852 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:16,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-11-14 18:19:17,227 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:17,238 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 31 treesize of output 30 [2018-11-14 18:19:17,240 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,246 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 31 treesize of output 30 [2018-11-14 18:19:17,248 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:17,510 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 30 treesize of output 39 [2018-11-14 18:19:17,514 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:17,521 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:17,544 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 30 treesize of output 39 [2018-11-14 18:19:17,547 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:17,888 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-14 18:19:17,901 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 6 treesize of output 1 [2018-11-14 18:19:17,901 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,930 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-14 18:19:17,931 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,950 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 6 treesize of output 1 [2018-11-14 18:19:17,951 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,960 INFO L267 ElimStorePlain]: Start of recursive call 102: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:17,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-14 18:19:17,992 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 6 treesize of output 1 [2018-11-14 18:19:17,992 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,023 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 5 treesize of output 3 [2018-11-14 18:19:18,024 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,041 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 6 treesize of output 1 [2018-11-14 18:19:18,043 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,053 INFO L267 ElimStorePlain]: Start of recursive call 106: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2018-11-14 18:19:18,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:18,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:18,311 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 27 treesize of output 21 [2018-11-14 18:19:18,314 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,370 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 18 treesize of output 16 [2018-11-14 18:19:18,372 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,411 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 12 treesize of output 10 [2018-11-14 18:19:18,413 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,450 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 13 treesize of output 7 [2018-11-14 18:19:18,451 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,474 INFO L267 ElimStorePlain]: Start of recursive call 110: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:18,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2018-11-14 18:19:18,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-14 18:19:18,527 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,586 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 18 treesize of output 12 [2018-11-14 18:19:18,588 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,624 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-14 18:19:18,626 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:18,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:18,659 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 16 treesize of output 10 [2018-11-14 18:19:18,661 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,681 INFO L267 ElimStorePlain]: Start of recursive call 115: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:18,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-14 18:19:18,789 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 5 treesize of output 3 [2018-11-14 18:19:18,790 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,825 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 6 treesize of output 1 [2018-11-14 18:19:18,826 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,830 INFO L267 ElimStorePlain]: Start of recursive call 120: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-14 18:19:18,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-14 18:19:18,849 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,867 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 6 treesize of output 1 [2018-11-14 18:19:18,868 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,873 INFO L267 ElimStorePlain]: Start of recursive call 123: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:18,894 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:18,921 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:18,948 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 85 treesize of output 62 [2018-11-14 18:19:18,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:18,959 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:19,058 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-11-14 18:19:19,306 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:19,314 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 31 treesize of output 30 [2018-11-14 18:19:19,316 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:19,321 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 31 treesize of output 30 [2018-11-14 18:19:19,323 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:19,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:19,585 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 30 treesize of output 39 [2018-11-14 18:19:19,589 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:19,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:19,619 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 2 case distinctions, treesize of input 30 treesize of output 39 [2018-11-14 18:19:19,650 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:20,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2018-11-14 18:19:20,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-14 18:19:20,035 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,178 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 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-14 18:19:20,180 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,324 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:20,325 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:20,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:19:20,328 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,381 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 12 treesize of output 10 [2018-11-14 18:19:20,384 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,442 INFO L267 ElimStorePlain]: Start of recursive call 133: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:20,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2018-11-14 18:19:20,517 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 24 treesize of output 18 [2018-11-14 18:19:20,519 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,801 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 15 treesize of output 13 [2018-11-14 18:19:20,807 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,920 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 18 treesize of output 13 [2018-11-14 18:19:20,924 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:21,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:21,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 18:19:21,017 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,094 INFO L267 ElimStorePlain]: Start of recursive call 138: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:21,197 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 20 treesize of output 19 [2018-11-14 18:19:21,205 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 5 treesize of output 3 [2018-11-14 18:19:21,206 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,222 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 6 treesize of output 1 [2018-11-14 18:19:21,223 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,226 INFO L267 ElimStorePlain]: Start of recursive call 143: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,263 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:21,286 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:24,111 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 85 treesize of output 62 [2018-11-14 18:19:24,121 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 9 treesize of output 8 [2018-11-14 18:19:24,122 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,242 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-11-14 18:19:24,418 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 18:19:24,432 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 31 treesize of output 30 [2018-11-14 18:19:24,434 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,439 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 31 treesize of output 30 [2018-11-14 18:19:24,442 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,452 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 31 treesize of output 30 [2018-11-14 18:19:24,455 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,455 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:19:24,456 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:24,649 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 27 treesize of output 36 [2018-11-14 18:19:24,653 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:24,808 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2018-11-14 18:19:24,828 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 27 treesize of output 21 [2018-11-14 18:19:24,830 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,894 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-14 18:19:24,896 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,946 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 13 treesize of output 7 [2018-11-14 18:19:24,947 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 18:19:24,994 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,035 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:19:25,037 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,064 INFO L267 ElimStorePlain]: Start of recursive call 154: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:25,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 38 [2018-11-14 18:19:25,251 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:25,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:25,275 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2018-11-14 18:19:25,280 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:25,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-11-14 18:19:25,401 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-14 18:19:25,483 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-14 18:19:25,563 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,635 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:25,636 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:25,636 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 16 treesize of output 10 [2018-11-14 18:19:25,638 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,718 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 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-14 18:19:25,722 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,773 INFO L267 ElimStorePlain]: Start of recursive call 160: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:25,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-14 18:19:25,872 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 6 treesize of output 1 [2018-11-14 18:19:25,876 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-14 18:19:25,898 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,904 INFO L267 ElimStorePlain]: Start of recursive call 167: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:25,939 INFO L267 ElimStorePlain]: Start of recursive call 148: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:25,978 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:25,988 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 82 treesize of output 59 [2018-11-14 18:19:25,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:26,000 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:26,121 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 40 treesize of output 50 [2018-11-14 18:19:26,313 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 18:19:26,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:26,380 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 30 treesize of output 39 [2018-11-14 18:19:26,383 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:26,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:26,414 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 30 treesize of output 39 [2018-11-14 18:19:26,416 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:26,419 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:19:26,420 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:26,429 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:26,451 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 30 treesize of output 39 [2018-11-14 18:19:26,454 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:26,666 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 28 treesize of output 27 [2018-11-14 18:19:26,668 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:26,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2018-11-14 18:19:26,887 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 24 treesize of output 18 [2018-11-14 18:19:26,890 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,030 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 27 treesize of output 25 [2018-11-14 18:19:27,032 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,158 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 24 treesize of output 18 [2018-11-14 18:19:27,159 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,282 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 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-14 18:19:27,305 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-14 18:19:27,501 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,554 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 15 treesize of output 10 [2018-11-14 18:19:27,557 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,584 INFO L267 ElimStorePlain]: Start of recursive call 178: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:27,714 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-14 18:19:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-14 18:19:27,725 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,758 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 11 [2018-11-14 18:19:27,761 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,798 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 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-14 18:19:27,801 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,814 INFO L267 ElimStorePlain]: Start of recursive call 185: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,843 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 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-14 18:19:27,872 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 25 treesize of output 23 [2018-11-14 18:19:27,874 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,930 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,932 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 20 treesize of output 14 [2018-11-14 18:19:27,933 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:27,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 18:19:27,988 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:28,022 INFO L267 ElimStorePlain]: Start of recursive call 189: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:28,081 INFO L267 ElimStorePlain]: Start of recursive call 172: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:28,107 INFO L267 ElimStorePlain]: Start of recursive call 170: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:30,396 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 79 treesize of output 56 [2018-11-14 18:19:30,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:30,404 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,508 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 40 treesize of output 50 [2018-11-14 18:19:30,734 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-14 18:19:30,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-14 18:19:30,754 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,769 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 31 treesize of output 30 [2018-11-14 18:19:30,773 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,009 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 30 treesize of output 31 [2018-11-14 18:19:31,013 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,026 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 30 treesize of output 31 [2018-11-14 18:19:31,027 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-14 18:19:31,307 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 27 treesize of output 21 [2018-11-14 18:19:31,309 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,440 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 18:19:31,442 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-14 18:19:31,558 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,666 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 19 treesize of output 13 [2018-11-14 18:19:31,667 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,764 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 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-14 18:19:31,767 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,887 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 18:19:31,889 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,948 INFO L267 ElimStorePlain]: Start of recursive call 200: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:31,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-14 18:19:32,039 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 27 treesize of output 21 [2018-11-14 18:19:32,041 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,163 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 24 treesize of output 18 [2018-11-14 18:19:32,165 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,276 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 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:19:32,278 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,411 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 18 treesize of output 16 [2018-11-14 18:19:32,413 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,470 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 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-14 18:19:32,472 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,503 INFO L267 ElimStorePlain]: Start of recursive call 207: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:32,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-11-14 18:19:32,746 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 28 treesize of output 16 [2018-11-14 18:19:32,748 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,796 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 16 treesize of output 14 [2018-11-14 18:19:32,799 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,841 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 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-14 18:19:32,843 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,872 INFO L267 ElimStorePlain]: Start of recursive call 213: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:32,895 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 1 case distinctions, treesize of input 31 treesize of output 33 [2018-11-14 18:19:32,914 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 28 treesize of output 16 [2018-11-14 18:19:32,915 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,971 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 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-14 18:19:32,975 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:33,035 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-14 18:19:33,037 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:33,084 INFO L267 ElimStorePlain]: Start of recursive call 217: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:33,233 INFO L267 ElimStorePlain]: Start of recursive call 195: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:19:33,306 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:19:35,475 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 207 treesize of output 184 [2018-11-14 18:19:35,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:35,487 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:35,659 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 41 treesize of output 51 [2018-11-14 18:19:35,891 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-14 18:19:35,901 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 29 treesize of output 28 [2018-11-14 18:19:35,903 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:35,904 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:19:35,905 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:36,109 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 28 treesize of output 29 [2018-11-14 18:19:36,111 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:36,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-11-14 18:19:36,465 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 19 treesize of output 7 [2018-11-14 18:19:36,488 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:36,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-11-14 18:19:36,873 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:36,944 INFO L267 ElimStorePlain]: Start of recursive call 227: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2018-11-14 18:19:37,071 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-14 18:19:37,072 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,155 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 16 treesize of output 3 [2018-11-14 18:19:37,156 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-11-14 18:19:37,220 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,226 INFO L267 ElimStorePlain]: Start of recursive call 230: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,239 INFO L267 ElimStorePlain]: Start of recursive call 223: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:37,284 INFO L267 ElimStorePlain]: Start of recursive call 221: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.