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/list-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:12:30,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:12:30,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:12:30,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:12:30,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:12:30,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:12:30,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:12:30,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:12:30,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:12:30,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:12:30,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:12:30,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:12:30,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:12:30,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:12:30,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:12:30,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:12:30,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:12:30,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:12:30,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:12:30,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:12:30,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:12:30,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:12:30,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:12:30,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:12:30,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:12:30,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:12:30,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:12:30,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:12:30,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:12:30,420 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:12:30,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:12:30,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:12:30,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:12:30,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:12:30,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:12:30,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:12:30,427 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:12:30,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:12:30,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:12:30,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:12:30,449 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:12:30,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:12:30,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:12:30,450 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:12:30,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:12:30,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:12:30,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:12:30,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:12:30,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:12:30,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:12:30,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:12:30,452 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:12:30,452 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:12:30,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:12:30,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:12:30,453 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:12:30,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:12:30,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:12:30,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:12:30,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:12:30,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:12:30,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:12:30,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:12:30,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:12:30,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:12:30,455 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:12:30,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:12:30,455 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:12:30,455 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:12:30,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:12:30,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:12:30,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:12:30,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:12:30,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:12:30,520 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:12:30,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-11-14 18:12:30,593 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e408280/1392422c35a4402ab40251132d8f6b23/FLAG906a02765 [2018-11-14 18:12:31,130 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:12:31,131 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-11-14 18:12:31,145 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e408280/1392422c35a4402ab40251132d8f6b23/FLAG906a02765 [2018-11-14 18:12:31,158 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e408280/1392422c35a4402ab40251132d8f6b23 [2018-11-14 18:12:31,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:12:31,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:12:31,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:12:31,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:12:31,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:12:31,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569e2fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31, skipping insertion in model container [2018-11-14 18:12:31,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:12:31,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:12:31,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:12:31,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:12:31,686 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:12:31,768 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:12:31,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31 WrapperNode [2018-11-14 18:12:31,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:12:31,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:12:31,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:12:31,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:12:31,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (1/1) ... [2018-11-14 18:12:31,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:12:31,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:12:31,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:12:31,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:12:31,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (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:12:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:12:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:12:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:12:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:12:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:12:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:12:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:12:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:12:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:12:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:12:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:12:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:12:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:12:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:12:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:12:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:12:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:12:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:12:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:12:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:12:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:12:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:12:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:12:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:12:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:12:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:12:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:12:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:12:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:12:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:12:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:12:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:12:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:12:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:12:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:12:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:12:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:12:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:12:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:12:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:12:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:12:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:12:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:12:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:12:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:12:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:12:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:12:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:12:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:12:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:12:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:12:33,006 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:12:33,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:12:33 BoogieIcfgContainer [2018-11-14 18:12:33,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:12:33,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:12:33,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:12:33,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:12:33,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:12:31" (1/3) ... [2018-11-14 18:12:33,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9aec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:12:33, skipping insertion in model container [2018-11-14 18:12:33,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:12:31" (2/3) ... [2018-11-14 18:12:33,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9aec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:12:33, skipping insertion in model container [2018-11-14 18:12:33,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:12:33" (3/3) ... [2018-11-14 18:12:33,015 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-11-14 18:12:33,025 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:12:33,033 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:12:33,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:12:33,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:12:33,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:12:33,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:12:33,086 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:12:33,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:12:33,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:12:33,086 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:12:33,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:12:33,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:12:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-14 18:12:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:12:33,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:33,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:33,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:33,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash 71799363, now seen corresponding path program 1 times [2018-11-14 18:12:33,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:33,130 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:12:33,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:33,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:33,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-14 18:12:33,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {40#true} is VALID [2018-11-14 18:12:33,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 18:12:33,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2018-11-14 18:12:33,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2018-11-14 18:12:33,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {40#true} is VALID [2018-11-14 18:12:33,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {40#true} is VALID [2018-11-14 18:12:33,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {40#true} is VALID [2018-11-14 18:12:33,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-14 18:12:33,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 18:12:33,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {41#false} is VALID [2018-11-14 18:12:33,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 18:12:33,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 18:12:33,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {41#false} is VALID [2018-11-14 18:12:33,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {41#false} is VALID [2018-11-14 18:12:33,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-14 18:12:33,500 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:12:33,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:12:33,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:12:33,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:12:33,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:12:33,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:33,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:12:33,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:33,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:12:33,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:12:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:12:33,581 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-14 18:12:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:33,853 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2018-11-14 18:12:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:12:33,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:12:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:12:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:12:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:12:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:12:33,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 18:12:34,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:34,513 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:12:34,514 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:12:34,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:12:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:12:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:12:34,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:34,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:12:34,575 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:12:34,576 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:12:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:34,580 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:12:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:12:34,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:34,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:34,582 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:12:34,582 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:12:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:34,586 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:12:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:12:34,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:34,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:34,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:34,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:12:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 18:12:34,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2018-11-14 18:12:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:34,593 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 18:12:34,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:12:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:12:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:12:34,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:34,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:34,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:34,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash 480132375, now seen corresponding path program 1 times [2018-11-14 18:12:34,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:34,596 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:12:34,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:34,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:35,006 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-14 18:12:35,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:12:35,346 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:12:35,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:35,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:35,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:35,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:12:35,604 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:12:35,625 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:12:35,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:35,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:35,638 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:12:35,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:12:35,641 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:35,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2018-11-14 18:12:35,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {249#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {249#true} is VALID [2018-11-14 18:12:35,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2018-11-14 18:12:35,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #106#return; {249#true} is VALID [2018-11-14 18:12:35,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret12 := main(); {249#true} is VALID [2018-11-14 18:12:35,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {249#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {269#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:35,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {269#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {269#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:35,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {269#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:35,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:35,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:35,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:35,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:35,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {276#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:35,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {314#(= (_ bv3 32) |main_#t~mem11|)} is VALID [2018-11-14 18:12:35,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {314#(= (_ bv3 32) |main_#t~mem11|)} assume #t~mem11 != 3bv32;havoc #t~mem11; {250#false} is VALID [2018-11-14 18:12:35,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2018-11-14 18:12:35,801 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:12:35,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:12:35,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:12:35,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:12:35,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:12:35,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:35,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:12:35,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:35,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:12:35,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:12:35,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:12:35,876 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-14 18:12:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:36,598 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 18:12:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:12:36,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:12:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 18:12:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 18:12:36,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-14 18:12:36,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:36,715 INFO L225 Difference]: With dead ends: 56 [2018-11-14 18:12:36,715 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 18:12:36,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:12:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 18:12:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-14 18:12:36,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:36,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 38 states. [2018-11-14 18:12:36,764 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 38 states. [2018-11-14 18:12:36,765 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 38 states. [2018-11-14 18:12:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:36,769 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-14 18:12:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 18:12:36,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:36,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:36,770 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 52 states. [2018-11-14 18:12:36,770 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 52 states. [2018-11-14 18:12:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:36,774 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-14 18:12:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 18:12:36,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:36,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:36,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:36,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:12:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-14 18:12:36,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2018-11-14 18:12:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:36,779 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-14 18:12:36,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:12:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-14 18:12:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:12:36,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:36,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:36,781 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:36,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1463719093, now seen corresponding path program 1 times [2018-11-14 18:12:36,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:36,782 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:12:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:36,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:36,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:12: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 8 treesize of output 7 [2018-11-14 18:12:37,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:37,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:37,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:37,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:12:37,158 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:12:37,223 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:12:37,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:37,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:37,238 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:12:37,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:12:37,240 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:37,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2018-11-14 18:12:37,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {539#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {539#true} is VALID [2018-11-14 18:12:37,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2018-11-14 18:12:37,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #106#return; {539#true} is VALID [2018-11-14 18:12:37,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret12 := main(); {539#true} is VALID [2018-11-14 18:12:37,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {539#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {559#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:37,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {559#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {559#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:37,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:37,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:37,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:37,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:37,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:37,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {566#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:37,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:37,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:37,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:37,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:37,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {582#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {598#(= (_ bv3 32) |main_#t~mem9|)} is VALID [2018-11-14 18:12:37,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {598#(= (_ bv3 32) |main_#t~mem9|)} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {540#false} is VALID [2018-11-14 18:12:37,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {540#false} assume true; {540#false} is VALID [2018-11-14 18:12:37,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {540#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {540#false} is VALID [2018-11-14 18:12:37,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {540#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {540#false} is VALID [2018-11-14 18:12:37,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {540#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {540#false} is VALID [2018-11-14 18:12:37,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {540#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {540#false} is VALID [2018-11-14 18:12:37,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {540#false} assume !false; {540#false} is VALID [2018-11-14 18:12:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:37,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:12:37,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:12:37,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:12:37,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:12:37,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:37,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:12:37,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:37,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:12:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:12:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:12:37,450 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 6 states. [2018-11-14 18:12:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:38,023 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:12:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:12:38,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:12:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 18:12:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 18:12:38,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 18:12:38,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:38,143 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:12:38,143 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:12:38,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:12:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:12:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2018-11-14 18:12:38,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:38,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 35 states. [2018-11-14 18:12:38,205 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 35 states. [2018-11-14 18:12:38,205 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 35 states. [2018-11-14 18:12:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:38,208 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:12:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:12:38,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:38,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:38,210 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 49 states. [2018-11-14 18:12:38,210 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 49 states. [2018-11-14 18:12:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:38,213 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:12:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:12:38,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:38,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:38,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:38,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:12:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-14 18:12:38,217 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2018-11-14 18:12:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:38,217 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-14 18:12:38,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:12:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-14 18:12:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:12:38,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:38,219 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:38,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1444025766, now seen corresponding path program 1 times [2018-11-14 18:12:38,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:38,220 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:12:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:38,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:38,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:12:38,386 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:12:38,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:38,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:38,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:38,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:12:38,427 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:12:38,435 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:12:38,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:38,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:38,445 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:12:38,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:12:38,449 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:38,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {832#true} call ULTIMATE.init(); {832#true} is VALID [2018-11-14 18:12:38,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {832#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {832#true} is VALID [2018-11-14 18:12:38,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {832#true} assume true; {832#true} is VALID [2018-11-14 18:12:38,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {832#true} {832#true} #106#return; {832#true} is VALID [2018-11-14 18:12:38,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {832#true} call #t~ret12 := main(); {832#true} is VALID [2018-11-14 18:12:38,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {832#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {852#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:38,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {852#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {852#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:38,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {852#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:38,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:38,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:38,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:38,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:38,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {859#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {875#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:38,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {875#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {875#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:38,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {875#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {882#(= (_ bv3 32) |main_#t~mem7|)} is VALID [2018-11-14 18:12:38,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {882#(= (_ bv3 32) |main_#t~mem7|)} assume !!(#t~mem7 == 1bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {833#false} is VALID [2018-11-14 18:12:38,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {833#false} assume true; {833#false} is VALID [2018-11-14 18:12:38,481 INFO L273 TraceCheckUtils]: 17: Hoare triple {833#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {833#false} is VALID [2018-11-14 18:12:38,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {833#false} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {833#false} is VALID [2018-11-14 18:12:38,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {833#false} assume true; {833#false} is VALID [2018-11-14 18:12:38,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {833#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {833#false} is VALID [2018-11-14 18:12:38,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {833#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {833#false} is VALID [2018-11-14 18:12:38,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {833#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {833#false} is VALID [2018-11-14 18:12:38,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {833#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {833#false} is VALID [2018-11-14 18:12:38,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {833#false} assume !false; {833#false} is VALID [2018-11-14 18:12:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:38,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:12:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:12:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:12:38,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:12:38,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:38,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:12:38,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:38,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:12:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:12:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:12:38,603 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 6 states. [2018-11-14 18:12:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:39,195 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:12:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:12:39,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:12:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 18:12:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:12:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 18:12:39,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 18:12:39,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:39,321 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:12:39,321 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 18:12:39,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:12:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 18:12:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-14 18:12:39,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:39,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 31 states. [2018-11-14 18:12:39,341 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 31 states. [2018-11-14 18:12:39,341 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 31 states. [2018-11-14 18:12:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:39,344 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-14 18:12:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-14 18:12:39,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:39,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:39,346 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 45 states. [2018-11-14 18:12:39,346 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 45 states. [2018-11-14 18:12:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:39,349 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-14 18:12:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-14 18:12:39,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:39,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:39,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:39,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:12:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:12:39,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2018-11-14 18:12:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:39,352 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:12:39,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:12:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:12:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:12:39,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:39,354 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] [2018-11-14 18:12:39,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:39,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1763938719, now seen corresponding path program 1 times [2018-11-14 18:12:39,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:39,355 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:12:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:39,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:39,500 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:12:39,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:12:39,515 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:39,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:39,628 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:12:39,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:12:39,667 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:12:39,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,692 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:12:39,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-14 18:12:39,703 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:39,877 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:12:39,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:12:39,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:39,907 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:12:39,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-14 18:12:39,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:40,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2018-11-14 18:12:40,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1113#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1113#true} is VALID [2018-11-14 18:12:40,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2018-11-14 18:12:40,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #106#return; {1113#true} is VALID [2018-11-14 18:12:40,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret12 := main(); {1113#true} is VALID [2018-11-14 18:12:40,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {1113#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1133#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:12:40,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {1133#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1133#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:12:40,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1133#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:40,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:40,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:40,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:40,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {1140#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {1153#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:40,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {1153#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1153#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:40,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:40,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:40,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:40,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {1160#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:40,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:40,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:40,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:40,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:40,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1170#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1186#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|))} is VALID [2018-11-14 18:12:40,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {1186#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|))} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {1114#false} is VALID [2018-11-14 18:12:40,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1114#false} is VALID [2018-11-14 18:12:40,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {1114#false} is VALID [2018-11-14 18:12:40,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2018-11-14 18:12:40,169 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:12:40,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:40,478 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 33 treesize of output 27 [2018-11-14 18:12:40,516 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:12:40,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,544 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:12:40,549 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:12:40,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,621 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 18 treesize of output 22 [2018-11-14 18:12:40,634 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 17 treesize of output 15 [2018-11-14 18:12:40,641 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,665 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:12:40,667 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,689 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 14 treesize of output 9 [2018-11-14 18:12:40,693 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:40,752 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:12:40,777 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 3 xjuncts. [2018-11-14 18:12:40,778 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-14 18:12:40,785 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:41,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2018-11-14 18:12:41,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {1114#false} is VALID [2018-11-14 18:12:41,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1114#false} is VALID [2018-11-14 18:12:41,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {1208#(= (_ bv2 32) |main_#t~mem9|)} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {1114#false} is VALID [2018-11-14 18:12:41,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1208#(= (_ bv2 32) |main_#t~mem9|)} is VALID [2018-11-14 18:12:41,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} assume true; {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:41,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:41,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:41,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} assume true; {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:41,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1212#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:41,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:41,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:41,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {1238#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1228#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:41,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {1238#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1238#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:41,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {1238#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:41,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume true; {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:12:41,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:12:41,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume true; {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:12:41,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {1258#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1245#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:12:41,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {1258#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1258#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:12:41,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1113#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1258#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:12:41,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret12 := main(); {1113#true} is VALID [2018-11-14 18:12:41,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #106#return; {1113#true} is VALID [2018-11-14 18:12:41,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2018-11-14 18:12:41,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {1113#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1113#true} is VALID [2018-11-14 18:12:41,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2018-11-14 18:12:41,074 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:12:41,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:12:41,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:12:41,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-14 18:12:41,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:41,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:12:41,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:41,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:12:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:12:41,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:12:41,170 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2018-11-14 18:12:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:44,530 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-14 18:12:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:12:44,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-14 18:12:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:12:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-14 18:12:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:12:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-14 18:12:44,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2018-11-14 18:12:44,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:44,892 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:12:44,893 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:12:44,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:12:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:12:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2018-11-14 18:12:44,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:44,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 42 states. [2018-11-14 18:12:44,963 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 42 states. [2018-11-14 18:12:44,963 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 42 states. [2018-11-14 18:12:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:44,966 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:12:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-14 18:12:44,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:44,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:44,967 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 66 states. [2018-11-14 18:12:44,967 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 66 states. [2018-11-14 18:12:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:44,971 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:12:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-14 18:12:44,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:44,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:44,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:44,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:12:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 18:12:44,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2018-11-14 18:12:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:44,974 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 18:12:44,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:12:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:12:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:12:44,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:44,975 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] [2018-11-14 18:12:44,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:44,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1735693153, now seen corresponding path program 1 times [2018-11-14 18:12:44,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:44,976 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:12:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:45,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:45,103 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:12:45,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:12:45,115 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:45,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:45,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-14 18:12:45,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:12:45,313 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:12:45,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,338 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:12:45,338 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-14 18:12:45,357 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:45,464 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:12:45,471 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:12:45,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:45,498 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:12:45,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-14 18:12:45,509 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:45,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {1558#true} call ULTIMATE.init(); {1558#true} is VALID [2018-11-14 18:12:45,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {1558#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1558#true} is VALID [2018-11-14 18:12:45,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {1558#true} assume true; {1558#true} is VALID [2018-11-14 18:12:45,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1558#true} {1558#true} #106#return; {1558#true} is VALID [2018-11-14 18:12:45,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {1558#true} call #t~ret12 := main(); {1558#true} is VALID [2018-11-14 18:12:45,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {1558#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1578#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:12:45,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {1578#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1578#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:12:45,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1578#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1585#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:45,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1585#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1585#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:45,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {1585#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1592#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {1592#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1592#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:12:45,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {1599#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1615#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:45,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {1615#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1615#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:45,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {1615#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1622#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:45,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {1622#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {1559#false} is VALID [2018-11-14 18:12:45,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {1559#false} assume true; {1559#false} is VALID [2018-11-14 18:12:45,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {1559#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1559#false} is VALID [2018-11-14 18:12:45,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {1559#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {1559#false} is VALID [2018-11-14 18:12:45,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {1559#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1559#false} is VALID [2018-11-14 18:12:45,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {1559#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {1559#false} is VALID [2018-11-14 18:12:45,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {1559#false} assume !false; {1559#false} is VALID [2018-11-14 18:12:45,690 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:12:45,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:45,950 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 33 treesize of output 27 [2018-11-14 18:12:45,995 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:12:45,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,036 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:12:46,058 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:12:46,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,083 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:12:46,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,102 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:12:46,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:46,117 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:12:46,123 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:12:46,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:46,146 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:12:46,167 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 3 xjuncts. [2018-11-14 18:12:46,168 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-14 18:12:46,177 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:46,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {1559#false} assume !false; {1559#false} is VALID [2018-11-14 18:12:46,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {1559#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {1559#false} is VALID [2018-11-14 18:12:46,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {1559#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1559#false} is VALID [2018-11-14 18:12:46,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {1559#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {1559#false} is VALID [2018-11-14 18:12:46,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {1559#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1559#false} is VALID [2018-11-14 18:12:46,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {1559#false} assume true; {1559#false} is VALID [2018-11-14 18:12:46,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {1662#(= (_ bv1 32) |main_#t~mem7|)} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {1559#false} is VALID [2018-11-14 18:12:46,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {1666#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1662#(= (_ bv1 32) |main_#t~mem7|)} is VALID [2018-11-14 18:12:46,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {1666#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume true; {1666#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:46,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1666#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:46,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {1689#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1673#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {1689#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1689#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {1696#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1689#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:46,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {1696#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))))} assume true; {1696#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))))} is VALID [2018-11-14 18:12:46,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {1703#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1696#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))))} is VALID [2018-11-14 18:12:46,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {1703#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1703#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:12:46,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {1558#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1703#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:12:46,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1558#true} call #t~ret12 := main(); {1558#true} is VALID [2018-11-14 18:12:46,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1558#true} {1558#true} #106#return; {1558#true} is VALID [2018-11-14 18:12:46,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1558#true} assume true; {1558#true} is VALID [2018-11-14 18:12:46,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {1558#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1558#true} is VALID [2018-11-14 18:12:46,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {1558#true} call ULTIMATE.init(); {1558#true} is VALID [2018-11-14 18:12:46,315 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:12:46,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:12:46,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:12:46,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-14 18:12:46,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:46,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:12:46,395 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:12:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:12:46,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:12:46,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:12:46,396 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 14 states. [2018-11-14 18:12:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:48,810 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:12:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:12:48,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-14 18:12:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:12:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-14 18:12:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:12:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-14 18:12:48,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2018-11-14 18:12:48,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:48,973 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:12:48,973 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:12:48,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:12:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:12:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-11-14 18:12:49,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:49,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 45 states. [2018-11-14 18:12:49,039 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 45 states. [2018-11-14 18:12:49,039 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 45 states. [2018-11-14 18:12:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:49,042 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:12:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-14 18:12:49,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:49,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:49,043 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 59 states. [2018-11-14 18:12:49,043 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 59 states. [2018-11-14 18:12:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:49,045 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:12:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-14 18:12:49,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:49,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:49,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:49,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:12:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-14 18:12:49,048 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 26 [2018-11-14 18:12:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:49,049 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-14 18:12:49,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:12:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:12:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:12:49,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:49,050 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:49,050 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:49,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2022271427, now seen corresponding path program 1 times [2018-11-14 18:12:49,051 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:12:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:12:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:49,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:49,260 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:12:49,267 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:12:49,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,306 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:12:49,313 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:12:49,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-14 18:12:49,369 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:49,414 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 23 treesize of output 16 [2018-11-14 18:12:49,419 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 16 treesize of output 15 [2018-11-14 18:12:49,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:12:49,514 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 25 treesize of output 21 [2018-11-14 18:12:49,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:12:49,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,543 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 21 treesize of output 17 [2018-11-14 18:12:49,548 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 17 treesize of output 9 [2018-11-14 18:12:49,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,555 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:12:49,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:12:49,559 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:49,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:12:49,608 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:12:49,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:12:49,616 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:49,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {1987#true} call ULTIMATE.init(); {1987#true} is VALID [2018-11-14 18:12:49,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1987#true} is VALID [2018-11-14 18:12:49,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {1987#true} assume true; {1987#true} is VALID [2018-11-14 18:12:49,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1987#true} {1987#true} #106#return; {1987#true} is VALID [2018-11-14 18:12:49,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {1987#true} call #t~ret12 := main(); {1987#true} is VALID [2018-11-14 18:12:49,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {1987#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2007#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:49,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {2007#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2007#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:49,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {2007#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:49,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {2014#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:49,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:49,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:49,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {2033#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:49,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {2043#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:49,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:49,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:49,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:49,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2075#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:49,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {2075#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} assume #t~mem11 != 3bv32;havoc #t~mem11; {1988#false} is VALID [2018-11-14 18:12:49,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2018-11-14 18:12:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:49,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:49,960 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-14 18:12:49,964 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 21 treesize of output 13 [2018-11-14 18:12:49,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, 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:12:49,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:49,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:49,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-14 18:12:49,997 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:50,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 [2018-11-14 18:12:50,225 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 7 treesize of output 3 [2018-11-14 18:12:50,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:50,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:50,231 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 13 treesize of output 11 [2018-11-14 18:12:50,241 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 7 treesize of output 3 [2018-11-14 18:12:50,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:50,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:50,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:50,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-14 18:12:50,282 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:50,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2018-11-14 18:12:50,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {2075#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} assume #t~mem11 != 3bv32;havoc #t~mem11; {1988#false} is VALID [2018-11-14 18:12:50,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2075#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:50,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:50,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:50,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2062#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:50,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume true; {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume true; {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2100#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:12:50,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:50,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:50,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2119#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:50,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {1987#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2129#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:50,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {1987#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1987#true} is VALID [2018-11-14 18:12:50,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {1987#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1987#true} is VALID [2018-11-14 18:12:50,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {1987#true} call #t~ret12 := main(); {1987#true} is VALID [2018-11-14 18:12:50,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1987#true} {1987#true} #106#return; {1987#true} is VALID [2018-11-14 18:12:50,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {1987#true} assume true; {1987#true} is VALID [2018-11-14 18:12:50,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1987#true} is VALID [2018-11-14 18:12:50,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {1987#true} call ULTIMATE.init(); {1987#true} is VALID [2018-11-14 18:12:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:12:50,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-14 18:12:50,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 18:12:50,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:50,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:12:50,465 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:12:50,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:12:50,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:12:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:12:50,466 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 11 states. [2018-11-14 18:12:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:51,869 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-14 18:12:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:12:51,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 18:12:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:12:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2018-11-14 18:12:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:12:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2018-11-14 18:12:51,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2018-11-14 18:12:52,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:52,040 INFO L225 Difference]: With dead ends: 92 [2018-11-14 18:12:52,041 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 18:12:52,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:12:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 18:12:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-11-14 18:12:52,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:52,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 66 states. [2018-11-14 18:12:52,202 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 66 states. [2018-11-14 18:12:52,202 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 66 states. [2018-11-14 18:12:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:52,205 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-14 18:12:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-11-14 18:12:52,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:52,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:52,206 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 88 states. [2018-11-14 18:12:52,207 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 88 states. [2018-11-14 18:12:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:52,210 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-14 18:12:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-11-14 18:12:52,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:52,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:52,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:52,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:12:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-11-14 18:12:52,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 29 [2018-11-14 18:12:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:52,214 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-11-14 18:12:52,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:12:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-14 18:12:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:12:52,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:52,215 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:52,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:52,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1430581023, now seen corresponding path program 2 times [2018-11-14 18:12:52,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:12:52,237 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:12:52,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:12:52,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:12:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:52,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:52,383 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:12:52,389 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:12:52,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,436 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:12:52,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-11-14 18:12:52,445 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:52,488 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 23 treesize of output 16 [2018-11-14 18:12:52,493 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 16 treesize of output 15 [2018-11-14 18:12:52,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:12:52,550 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 25 treesize of output 21 [2018-11-14 18:12:52,557 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 13 [2018-11-14 18:12:52,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,577 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 21 treesize of output 17 [2018-11-14 18:12:52,591 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 17 treesize of output 9 [2018-11-14 18:12:52,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,597 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:12:52,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:12:52,608 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:52,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:12:52,633 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:12:52,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:12:52,642 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:52,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2018-11-14 18:12:52,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2537#true} is VALID [2018-11-14 18:12:52,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2018-11-14 18:12:52,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #106#return; {2537#true} is VALID [2018-11-14 18:12:52,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret12 := main(); {2537#true} is VALID [2018-11-14 18:12:52,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {2537#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2557#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:52,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {2557#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2557#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:52,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {2557#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:52,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {2564#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:52,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:52,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:52,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {2583#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:52,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {2593#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2612#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:52,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {2612#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2612#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:52,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {2612#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2619#(= (_ bv3 32) |main_#t~mem9|)} is VALID [2018-11-14 18:12:52,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {2619#(= (_ bv3 32) |main_#t~mem9|)} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2538#false} is VALID [2018-11-14 18:12:52,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {2538#false} assume true; {2538#false} is VALID [2018-11-14 18:12:52,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {2538#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2538#false} is VALID [2018-11-14 18:12:52,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {2538#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {2538#false} is VALID [2018-11-14 18:12:52,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {2538#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2538#false} is VALID [2018-11-14 18:12:52,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {2538#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {2538#false} is VALID [2018-11-14 18:12:52,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2018-11-14 18:12:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:52,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:52,830 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 32 treesize of output 24 [2018-11-14 18:12:52,843 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 14 treesize of output 1 [2018-11-14 18:12:52,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 24 [2018-11-14 18:12:52,859 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 14 treesize of output 1 [2018-11-14 18:12:52,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:52,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:52,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-11-14 18:12:52,882 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:53,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 [2018-11-14 18:12:53,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 18:12:53,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:53,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:53,055 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 13 treesize of output 11 [2018-11-14 18:12:53,061 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 7 treesize of output 3 [2018-11-14 18:12:53,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:53,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:53,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:53,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:7 [2018-11-14 18:12:53,096 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:53,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2018-11-14 18:12:53,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {2538#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {2538#false} is VALID [2018-11-14 18:12:53,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {2538#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2538#false} is VALID [2018-11-14 18:12:53,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {2538#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {2538#false} is VALID [2018-11-14 18:12:53,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {2538#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2538#false} is VALID [2018-11-14 18:12:53,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {2538#false} assume true; {2538#false} is VALID [2018-11-14 18:12:53,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {2659#(not (= (_ bv2 32) |main_#t~mem9|))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2538#false} is VALID [2018-11-14 18:12:53,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {2663#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2659#(not (= (_ bv2 32) |main_#t~mem9|))} is VALID [2018-11-14 18:12:53,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {2663#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2663#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2663#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2670#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:53,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:53,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:53,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2689#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:53,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {2537#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2699#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:53,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {2537#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2537#true} is VALID [2018-11-14 18:12:53,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {2537#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2537#true} is VALID [2018-11-14 18:12:53,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret12 := main(); {2537#true} is VALID [2018-11-14 18:12:53,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #106#return; {2537#true} is VALID [2018-11-14 18:12:53,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2018-11-14 18:12:53,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2537#true} is VALID [2018-11-14 18:12:53,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2018-11-14 18:12:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:53,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:12:53,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 18:12:53,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-14 18:12:53,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:53,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:12:53,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:53,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:12:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:12:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:12:53,247 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 13 states. [2018-11-14 18:12:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:55,263 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-14 18:12:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:12:55,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-14 18:12:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:12:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2018-11-14 18:12:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:12:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2018-11-14 18:12:55,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2018-11-14 18:12:55,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:55,400 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:12:55,400 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:12:55,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:12:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:12:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2018-11-14 18:12:55,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:55,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 59 states. [2018-11-14 18:12:55,464 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 59 states. [2018-11-14 18:12:55,465 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 59 states. [2018-11-14 18:12:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:55,468 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-14 18:12:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-14 18:12:55,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:55,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:55,469 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 82 states. [2018-11-14 18:12:55,469 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 82 states. [2018-11-14 18:12:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:55,472 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-14 18:12:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-14 18:12:55,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:55,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:55,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:55,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:12:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-11-14 18:12:55,474 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 32 [2018-11-14 18:12:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:55,475 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-14 18:12:55,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:12:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-14 18:12:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:12:55,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:55,476 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:55,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:55,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash -276340545, now seen corresponding path program 1 times [2018-11-14 18:12:55,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:12:55,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:12:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:55,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:55,638 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:12:55,679 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:12:55,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,803 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:12:55,809 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:12:55,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-14 18:12:55,864 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:55,911 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 23 treesize of output 16 [2018-11-14 18:12:55,916 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 16 treesize of output 15 [2018-11-14 18:12:55,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:55,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:12:56,031 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 25 treesize of output 21 [2018-11-14 18:12:56,037 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 13 [2018-11-14 18:12:56,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,050 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 21 treesize of output 17 [2018-11-14 18:12:56,055 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 17 treesize of output 9 [2018-11-14 18:12:56,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,068 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:12:56,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:12:56,072 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:56,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:12:56,098 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:12:56,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:12:56,109 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:56,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {3096#true} call ULTIMATE.init(); {3096#true} is VALID [2018-11-14 18:12:56,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {3096#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3096#true} is VALID [2018-11-14 18:12:56,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {3096#true} assume true; {3096#true} is VALID [2018-11-14 18:12:56,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3096#true} {3096#true} #106#return; {3096#true} is VALID [2018-11-14 18:12:56,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {3096#true} call #t~ret12 := main(); {3096#true} is VALID [2018-11-14 18:12:56,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {3096#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {3116#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:56,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {3116#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3116#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:12:56,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {3116#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:12:56,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {3123#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {3142#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem7 == 1bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3162#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:56,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {3162#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {3162#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:12:56,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {3162#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3169#(= (_ bv3 32) |main_#t~mem7|)} is VALID [2018-11-14 18:12:56,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {3169#(= (_ bv3 32) |main_#t~mem7|)} assume !!(#t~mem7 == 1bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3097#false} is VALID [2018-11-14 18:12:56,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 18:12:56,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#false} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {3097#false} is VALID [2018-11-14 18:12:56,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 18:12:56,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {3097#false} is VALID [2018-11-14 18:12:56,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {3097#false} is VALID [2018-11-14 18:12:56,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#false} assume !false; {3097#false} is VALID [2018-11-14 18:12:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:56,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:56,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2018-11-14 18:12:56,274 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 12 treesize of output 1 [2018-11-14 18:12:56,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,282 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 30 treesize of output 22 [2018-11-14 18:12:56,289 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 12 treesize of output 1 [2018-11-14 18:12:56,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:56,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-11-14 18:12:56,315 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:56,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 [2018-11-14 18:12:56,494 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 7 treesize of output 3 [2018-11-14 18:12:56,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,501 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 13 treesize of output 11 [2018-11-14 18:12:56,506 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 7 treesize of output 3 [2018-11-14 18:12:56,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:56,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:56,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-14 18:12:56,576 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:56,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#false} assume !false; {3097#false} is VALID [2018-11-14 18:12:56,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {3097#false} is VALID [2018-11-14 18:12:56,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#false} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {3097#false} is VALID [2018-11-14 18:12:56,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 18:12:56,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#false} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {3097#false} is VALID [2018-11-14 18:12:56,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3097#false} is VALID [2018-11-14 18:12:56,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 18:12:56,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {3227#(not (= (_ bv1 32) |main_#t~mem7|))} assume !!(#t~mem7 == 1bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3097#false} is VALID [2018-11-14 18:12:56,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {3231#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3227#(not (= (_ bv1 32) |main_#t~mem7|))} is VALID [2018-11-14 18:12:56,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {3231#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3231#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(#t~mem7 == 1bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3231#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3238#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:12:56,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3248#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:12:56,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {3096#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3258#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:12:56,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {3096#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3096#true} is VALID [2018-11-14 18:12:56,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {3096#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {3096#true} is VALID [2018-11-14 18:12:56,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {3096#true} call #t~ret12 := main(); {3096#true} is VALID [2018-11-14 18:12:56,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3096#true} {3096#true} #106#return; {3096#true} is VALID [2018-11-14 18:12:56,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {3096#true} assume true; {3096#true} is VALID [2018-11-14 18:12:56,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {3096#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3096#true} is VALID [2018-11-14 18:12:56,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {3096#true} call ULTIMATE.init(); {3096#true} is VALID [2018-11-14 18:12:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:12:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:12:56,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 18:12:56,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-14 18:12:56,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:12:56,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:12:56,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:56,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:12:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:12:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:12:56,872 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 13 states. [2018-11-14 18:12:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:58,988 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-14 18:12:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:12:58,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-14 18:12:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:12:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:12:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:12:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:12:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:12:58,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 18:12:59,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:12:59,121 INFO L225 Difference]: With dead ends: 88 [2018-11-14 18:12:59,121 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 18:12:59,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:12:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 18:12:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-11-14 18:12:59,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:12:59,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 55 states. [2018-11-14 18:12:59,183 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 55 states. [2018-11-14 18:12:59,183 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 55 states. [2018-11-14 18:12:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:59,185 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-14 18:12:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-11-14 18:12:59,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:59,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:59,186 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 71 states. [2018-11-14 18:12:59,186 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 71 states. [2018-11-14 18:12:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:12:59,189 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-14 18:12:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-11-14 18:12:59,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:12:59,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:12:59,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:12:59,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:12:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 18:12:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-14 18:12:59,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 32 [2018-11-14 18:12:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:12:59,192 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-14 18:12:59,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:12:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-14 18:12:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:12:59,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:12:59,193 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:12:59,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:12:59,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:12:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash 247295035, now seen corresponding path program 3 times [2018-11-14 18:12:59,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:12:59,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:12:59,211 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:12:59,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 18:12:59,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:12:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:12:59,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:12:59,362 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:12:59,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:12:59,376 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:59,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:59,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:59,446 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 19 treesize of output 23 [2018-11-14 18:12:59,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:26 [2018-11-14 18:12:59,474 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:59,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-11-14 18:12:59,560 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:12:59,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,626 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 10 [2018-11-14 18:12:59,653 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 10 treesize of output 9 [2018-11-14 18:12:59,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:52 [2018-11-14 18:12:59,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:59,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:59,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:59,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:12:59,818 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 26 treesize of output 25 [2018-11-14 18:12:59,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-14 18:12:59,881 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 19 [2018-11-14 18:12:59,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:59,927 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:12:59,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-11-14 18:12:59,936 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:00,067 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 103 treesize of output 104 [2018-11-14 18:13:00,080 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 22 treesize of output 21 [2018-11-14 18:13:00,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,214 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 113 treesize of output 107 [2018-11-14 18:13:00,232 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 22 treesize of output 21 [2018-11-14 18:13:00,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:130, output treesize:104 [2018-11-14 18:13:00,355 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:00,554 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 55 treesize of output 60 [2018-11-14 18:13:00,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-14 18:13:00,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:13:00,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:88 [2018-11-14 18:13:00,639 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:00,948 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 86 treesize of output 76 [2018-11-14 18:13:00,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2018-11-14 18:13:00,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:00,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,036 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 78 treesize of output 52 [2018-11-14 18:13:01,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-14 18:13:01,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:13:01,083 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-14 18:13:01,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:13:01,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 18:13:01,136 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:108, output treesize:36 [2018-11-14 18:13:01,147 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:01,263 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 29 treesize of output 33 [2018-11-14 18:13:01,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 18:13:01,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,294 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:13:01,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:01,314 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2018-11-14 18:13:01,318 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:01,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {3621#true} call ULTIMATE.init(); {3621#true} is VALID [2018-11-14 18:13:01,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {3621#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3621#true} is VALID [2018-11-14 18:13:01,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {3621#true} assume true; {3621#true} is VALID [2018-11-14 18:13:01,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3621#true} {3621#true} #106#return; {3621#true} is VALID [2018-11-14 18:13:01,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {3621#true} call #t~ret12 := main(); {3621#true} is VALID [2018-11-14 18:13:01,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {3621#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {3641#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {3641#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3641#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {3641#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:13:01,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:13:01,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:13:01,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:13:01,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {3648#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {3661#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {3661#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3661#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {3661#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3668#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {3668#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume true; {3668#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:13:01,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {3668#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {3675#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:13:01,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {3675#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3675#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:13:01,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {3675#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:13:01,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume true; {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:13:01,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:13:01,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {3682#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,720 INFO L273 TraceCheckUtils]: 21: Hoare triple {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume true; {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(#t~mem7 == 1bv32);havoc #t~mem7; {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume true; {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {3692#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3708#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:13:01,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {3708#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|) (exists ((v_main_~p~0.offset_55 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_55))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(#t~mem9 == 2bv32);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {3712#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32)) (v_main_~p~0.base_56 (_ BitVec 32))) (and (not (= v_main_~p~0.base_56 v_arrayElimCell_67)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_67) v_main_~p~0.offset_55)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= main_~p~0.base v_arrayElimCell_67)) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} is VALID [2018-11-14 18:13:01,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {3712#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32)) (v_main_~p~0.base_56 (_ BitVec 32))) (and (not (= v_main_~p~0.base_56 v_arrayElimCell_67)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_67) v_main_~p~0.offset_55)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= main_~p~0.base v_arrayElimCell_67)) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} assume true; {3712#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32)) (v_main_~p~0.base_56 (_ BitVec 32))) (and (not (= v_main_~p~0.base_56 v_arrayElimCell_67)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_67) v_main_~p~0.offset_55)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= main_~p~0.base v_arrayElimCell_67)) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} is VALID [2018-11-14 18:13:01,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {3712#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_55 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32)) (v_main_~p~0.base_56 (_ BitVec 32))) (and (not (= v_main_~p~0.base_56 v_arrayElimCell_67)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_67) v_main_~p~0.offset_55)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= main_~p~0.base v_arrayElimCell_67)) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3719#(= (_ bv2 32) |main_#t~mem9|)} is VALID [2018-11-14 18:13:01,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {3719#(= (_ bv2 32) |main_#t~mem9|)} assume !(#t~mem9 == 2bv32);havoc #t~mem9; {3622#false} is VALID [2018-11-14 18:13:01,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {3622#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3622#false} is VALID [2018-11-14 18:13:01,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {3622#false} assume #t~mem11 != 3bv32;havoc #t~mem11; {3622#false} is VALID [2018-11-14 18:13:01,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {3622#false} assume !false; {3622#false} is VALID [2018-11-14 18:13:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:13:01,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:13:04,606 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 98 treesize of output 75 [2018-11-14 18:13:04,742 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 18:13:04,751 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:13:04,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:04,883 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 60 treesize of output 64 [2018-11-14 18:13:04,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 59 treesize of output 53 [2018-11-14 18:13:04,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:05,022 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 53 treesize of output 47 [2018-11-14 18:13:05,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:05,139 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 56 treesize of output 44 [2018-11-14 18:13:05,143 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:05,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:05,303 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 3 case distinctions, treesize of input 59 treesize of output 93 [2018-11-14 18:13:05,390 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 59 treesize of output 53 [2018-11-14 18:13:05,422 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:06,148 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 59 treesize of output 53 [2018-11-14 18:13:06,158 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:06,594 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 53 treesize of output 48 [2018-11-14 18:13:06,596 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:07,068 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 58 treesize of output 64 [2018-11-14 18:13:07,072 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:07,457 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 78 treesize of output 72 [2018-11-14 18:13:07,462 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:07,812 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 53 treesize of output 48 [2018-11-14 18:13:07,815 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:08,148 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 39 treesize of output 45 [2018-11-14 18:13:08,151 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:08,822 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 72 treesize of output 54 [2018-11-14 18:13:08,825 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,018 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 51 treesize of output 45 [2018-11-14 18:13:09,020 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,228 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 77 treesize of output 63 [2018-11-14 18:13:09,230 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,410 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 63 treesize of output 45 [2018-11-14 18:13:09,412 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:13:09,584 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 60 treesize of output 64 [2018-11-14 18:13:09,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-11-14 18:13:09,598 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-11-14 18:13:09,718 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,801 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:13:09,909 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 59 treesize of output 93 [2018-11-14 18:13:09,944 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 59 treesize of output 53 [2018-11-14 18:13:09,946 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:10,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2018-11-14 18:13:10,438 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:10,876 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 0 case distinctions, treesize of input 60 treesize of output 66 [2018-11-14 18:13:10,879 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:11,289 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 0 case distinctions, treesize of input 58 treesize of output 64 [2018-11-14 18:13:11,291 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:11,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-11-14 18:13:11,688 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:12,042 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 0 case distinctions, treesize of input 39 treesize of output 45 [2018-11-14 18:13:12,049 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:12,302 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 63 treesize of output 45 [2018-11-14 18:13:12,304 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:12,615 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 58 treesize of output 52 [2018-11-14 18:13:12,619 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:12,765 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 52 treesize of output 47 [2018-11-14 18:13:12,768 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:13,039 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 50 treesize of output 45 [2018-11-14 18:13:13,042 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-14 18:13:13,295 INFO L267 ElimStorePlain]: Start of recursive call 23: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:13:13,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-14 18:13:13,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 10 xjuncts. [2018-11-14 18:13:13,870 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 4 variables, input treesize:104, output treesize:449 [2018-11-14 18:13:16,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:13:59,604 WARN L179 SmtUtils]: Spent 32.68 s on a formula simplification. DAG size of input: 182 DAG size of output: 115 [2018-11-14 18:14:01,957 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 50 treesize of output 41 [2018-11-14 18:14:02,072 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-14 18:14:02,078 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:14:02,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:02,153 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 21 treesize of output 25 [2018-11-14 18:14:02,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-14 18:14:02,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 18:14:02,220 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 20 treesize of output 12 [2018-11-14 18:14:02,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:02,253 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 12 treesize of output 3 [2018-11-14 18:14:02,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:02,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:14:02,270 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 17 [2018-11-14 18:14:02,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-14 18:14:02,278 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:02,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:02,319 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:14:12,409 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 88 treesize of output 59 [2018-11-14 18:14:12,579 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-14 18:14:12,585 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:14:12,586 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,666 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 17 [2018-11-14 18:14:12,674 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:14:12,674 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,681 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,727 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 29 treesize of output 31 [2018-11-14 18:14:12,762 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 26 treesize of output 18 [2018-11-14 18:14:12,764 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,816 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 23 treesize of output 14 [2018-11-14 18:14:12,819 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,852 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 10 [2018-11-14 18:14:12,854 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:12,863 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:14:12,908 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts.