java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:16:59,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:16:59,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:16:59,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:16:59,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:16:59,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:16:59,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:16:59,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:16:59,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:16:59,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:16:59,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:16:59,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:16:59,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:16:59,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:16:59,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:16:59,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:16:59,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:16:59,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:16:59,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:16:59,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:16:59,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:16:59,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:16:59,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:16:59,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:16:59,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:16:59,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:16:59,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:16:59,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:16:59,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:16:59,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:16:59,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:16:59,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:16:59,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:16:59,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:16:59,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:16:59,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:16:59,339 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:16:59,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:16:59,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:16:59,369 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:16:59,370 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:16:59,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:16:59,371 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:16:59,372 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:16:59,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:16:59,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:16:59,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:16:59,373 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:16:59,374 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:16:59,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:16:59,374 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:16:59,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:16:59,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:16:59,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:16:59,375 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:16:59,375 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:16:59,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:16:59,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:16:59,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:16:59,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:16:59,377 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:16:59,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:16:59,377 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:16:59,377 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:16:59,377 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:16:59,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:16:59,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:16:59,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:16:59,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:16:59,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:16:59,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:16:59,511 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5bfdab5/0e7ae6f26664465d9e9e71d3ba9c314a/FLAG5aba7e873 [2018-11-14 18:17:00,001 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:17:00,005 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:00,019 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5bfdab5/0e7ae6f26664465d9e9e71d3ba9c314a/FLAG5aba7e873 [2018-11-14 18:17:00,035 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5bfdab5/0e7ae6f26664465d9e9e71d3ba9c314a [2018-11-14 18:17:00,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:17:00,047 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:17:00,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:00,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:17:00,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:17:00,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e3a03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00, skipping insertion in model container [2018-11-14 18:17:00,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:17:00,132 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:17:00,544 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:00,561 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:17:00,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:00,685 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:17:00,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00 WrapperNode [2018-11-14 18:17:00,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:00,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:17:00,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:17:00,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:17:00,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... [2018-11-14 18:17:00,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:17:00,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:17:00,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:17:00,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:17:00,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:17:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:17:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:17:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:17:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:17:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:17:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:17:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:17:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:17:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:17:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:17:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:17:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:17:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:17:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:17:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:17:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:17:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:17:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:17:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:17:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:17:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:17:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:17:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:17:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:17:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:17:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:17:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:17:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:17:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:17:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:17:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:17:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:17:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:17:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:17:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:17:02,110 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:17:02,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:02 BoogieIcfgContainer [2018-11-14 18:17:02,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:17:02,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:17:02,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:17:02,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:17:02,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:17:00" (1/3) ... [2018-11-14 18:17:02,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358241e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:02, skipping insertion in model container [2018-11-14 18:17:02,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:00" (2/3) ... [2018-11-14 18:17:02,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358241e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:02, skipping insertion in model container [2018-11-14 18:17:02,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:02" (3/3) ... [2018-11-14 18:17:02,119 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:02,130 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:17:02,138 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 18:17:02,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 18:17:02,189 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:17:02,190 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:17:02,190 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:17:02,190 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:17:02,190 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:17:02,190 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:17:02,191 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:17:02,191 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:17:02,191 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:17:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 18:17:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:17:02,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:02,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:02,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:02,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1513764545, now seen corresponding path program 1 times [2018-11-14 18:17:02,228 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:02,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:02,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 18:17:02,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 18:17:02,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 18:17:02,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #136#return; {45#true} is VALID [2018-11-14 18:17:02,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret17 := main(); {45#true} is VALID [2018-11-14 18:17:02,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {45#true} is VALID [2018-11-14 18:17:02,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 18:17:02,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {46#false} is VALID [2018-11-14 18:17:02,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 18:17:02,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {46#false} is VALID [2018-11-14 18:17:02,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 18:17:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:02,385 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:02,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:02,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:17:02,393 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:02,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:02,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:17:02,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:02,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:17:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:17:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:17:02,469 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 18:17:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:02,815 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2018-11-14 18:17:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:17:02,815 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2018-11-14 18:17:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2018-11-14 18:17:02,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2018-11-14 18:17:03,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:03,625 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:17:03,625 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:17:03,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:17:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:17:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 18:17:03,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:03,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 18:17:03,666 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:17:03,666 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:17:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:03,674 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:17:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:17:03,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:03,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:03,675 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:17:03,676 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:17:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:03,683 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:17:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:17:03,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:03,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:03,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:03,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:17:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 18:17:03,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2018-11-14 18:17:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:03,693 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 18:17:03,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:17:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:17:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:17:03,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:03,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:03,695 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:03,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1039758525, now seen corresponding path program 1 times [2018-11-14 18:17:03,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:03,696 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:03,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:03,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:03,980 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 11 treesize of output 8 [2018-11-14 18:17:03,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:17:03,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:03,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:04,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:04,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-14 18:17:04,163 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 15 treesize of output 11 [2018-11-14 18:17:04,178 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:17:04,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:04,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:04,216 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:17:04,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:4 [2018-11-14 18:17:04,221 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:04,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-14 18:17:04,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-14 18:17:04,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-14 18:17:04,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #136#return; {278#true} is VALID [2018-11-14 18:17:04,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret17 := main(); {278#true} is VALID [2018-11-14 18:17:04,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:17:04,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} assume true; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:17:04,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:17:04,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {308#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:04,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#(not (= (_ bv0 32) main_~x~0.base))} assume true; {308#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:04,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {279#false} is VALID [2018-11-14 18:17:04,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-14 18:17:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:04,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:17:04,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:17:04,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:04,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:17:04,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:04,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:17:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:17:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:17:04,355 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-14 18:17:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:05,169 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 18:17:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:17:05,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:17:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:17:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 18:17:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:17:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 18:17:05,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2018-11-14 18:17:05,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:05,290 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:17:05,290 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:17:05,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:17:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:17:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-11-14 18:17:05,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:05,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 36 states. [2018-11-14 18:17:05,315 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 36 states. [2018-11-14 18:17:05,315 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 36 states. [2018-11-14 18:17:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:05,320 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:17:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:17:05,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:05,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:05,322 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 57 states. [2018-11-14 18:17:05,322 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 57 states. [2018-11-14 18:17:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:05,326 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:17:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:17:05,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:05,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:05,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:05,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:17:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-14 18:17:05,331 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2018-11-14 18:17:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:05,332 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-14 18:17:05,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:17:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 18:17:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:17:05,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:05,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:05,333 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:05,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1969300825, now seen corresponding path program 1 times [2018-11-14 18:17:05,334 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:05,335 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:17:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:05,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:05,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {552#true} call ULTIMATE.init(); {552#true} is VALID [2018-11-14 18:17:05,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {552#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {552#true} is VALID [2018-11-14 18:17:05,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {552#true} assume true; {552#true} is VALID [2018-11-14 18:17:05,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {552#true} {552#true} #136#return; {552#true} is VALID [2018-11-14 18:17:05,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {552#true} call #t~ret17 := main(); {552#true} is VALID [2018-11-14 18:17:05,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {552#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:17:05,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume true; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:17:05,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:17:05,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume #t~nondet4 != 0bv32;havoc #t~nondet4; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:17:05,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume !(~state~0 == 1bv32); {553#false} is VALID [2018-11-14 18:17:05,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {553#false} assume !(~state~0 == 2bv32); {553#false} is VALID [2018-11-14 18:17:05,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {553#false} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {553#false} is VALID [2018-11-14 18:17:05,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {553#false} assume true; {553#false} is VALID [2018-11-14 18:17:05,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {553#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {553#false} is VALID [2018-11-14 18:17:05,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {553#false} assume !false; {553#false} is VALID [2018-11-14 18:17:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:05,457 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:05,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:05,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:17:05,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:17:05,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:05,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:17:05,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:05,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:17:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:17:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:05,485 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2018-11-14 18:17:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:05,763 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-14 18:17:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:17:05,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:17:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 18:17:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 18:17:05,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-14 18:17:05,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:05,977 INFO L225 Difference]: With dead ends: 85 [2018-11-14 18:17:05,978 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:17:05,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:17:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-11-14 18:17:06,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:06,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 44 states. [2018-11-14 18:17:06,044 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 44 states. [2018-11-14 18:17:06,044 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 44 states. [2018-11-14 18:17:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:06,048 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 18:17:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-14 18:17:06,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:06,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:06,049 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 60 states. [2018-11-14 18:17:06,049 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 60 states. [2018-11-14 18:17:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:06,053 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 18:17:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-14 18:17:06,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:06,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:06,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:06,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:17:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-14 18:17:06,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 15 [2018-11-14 18:17:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:06,057 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-14 18:17:06,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:17:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 18:17:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:17:06,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:06,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:06,059 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:06,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 462917072, now seen corresponding path program 1 times [2018-11-14 18:17:06,060 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:06,061 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:17:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:06,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:06,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2018-11-14 18:17:06,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {878#true} is VALID [2018-11-14 18:17:06,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:17:06,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {878#true} {878#true} #136#return; {878#true} is VALID [2018-11-14 18:17:06,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {878#true} call #t~ret17 := main(); {878#true} is VALID [2018-11-14 18:17:06,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {878#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {878#true} is VALID [2018-11-14 18:17:06,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:17:06,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {878#true} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {878#true} is VALID [2018-11-14 18:17:06,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {878#true} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {878#true} is VALID [2018-11-14 18:17:06,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:17:06,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {878#true} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {878#true} is VALID [2018-11-14 18:17:06,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:17:06,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:17:06,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {878#true} call #t~mem6 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {878#true} is VALID [2018-11-14 18:17:06,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {878#true} assume !!(#t~mem6 != 0bv32);havoc #t~mem6; {878#true} is VALID [2018-11-14 18:17:06,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {878#true} assume true;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);#t~short12 := #t~mem8 == 0bv32; {878#true} is VALID [2018-11-14 18:17:06,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#true} assume #t~short12; {931#|main_#t~short12|} is VALID [2018-11-14 18:17:06,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#|main_#t~short12|} assume !#t~short12;havoc #t~mem11;havoc #t~mem10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~short12;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {879#false} is VALID [2018-11-14 18:17:06,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {879#false} assume !false; {879#false} is VALID [2018-11-14 18:17:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:06,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:06,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:06,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:17:06,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:17:06,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:06,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:17:06,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:06,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:17:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:17:06,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:06,304 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-11-14 18:17:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:06,442 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-14 18:17:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:17:06,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:17:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-14 18:17:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:17:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-14 18:17:06,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-14 18:17:06,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:06,518 INFO L225 Difference]: With dead ends: 47 [2018-11-14 18:17:06,518 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 18:17:06,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:17:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 18:17:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 18:17:06,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:06,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 18:17:06,553 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 18:17:06,553 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 18:17:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:06,556 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-14 18:17:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-14 18:17:06,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:06,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:06,557 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 18:17:06,558 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 18:17:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:06,560 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-14 18:17:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-14 18:17:06,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:06,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:06,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:06,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:17:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-14 18:17:06,564 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 19 [2018-11-14 18:17:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:06,565 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-14 18:17:06,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:17:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-14 18:17:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:17:06,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:06,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:06,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:06,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 462918994, now seen corresponding path program 1 times [2018-11-14 18:17:06,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:06,567 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:17:06,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:06,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:06,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:17:06,744 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:17:06,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:06,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:06,787 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:17:06,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-14 18:17:06,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:06,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:06,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:06,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-14 18:17:06,931 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:17:06,935 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:17:06,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:07,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:07,024 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:17:07,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-11-14 18:17:07,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1143#true} is VALID [2018-11-14 18:17:07,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1143#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1143#true} is VALID [2018-11-14 18:17:07,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {1143#true} assume true; {1143#true} is VALID [2018-11-14 18:17:07,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1143#true} {1143#true} #136#return; {1143#true} is VALID [2018-11-14 18:17:07,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {1143#true} call #t~ret17 := main(); {1143#true} is VALID [2018-11-14 18:17:07,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {1143#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:17:07,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume true; {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:17:07,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-14 18:17:07,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(and (= (_ bv1 32) main_~state~0) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} call #t~mem6 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume !!(#t~mem6 != 0bv32);havoc #t~mem6; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);#t~short12 := #t~mem8 == 0bv32; {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:07,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {1173#(exists ((main_~head~0.base (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume !#t~short12;call #t~mem10 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem11 := read~intINTTYPE4(#t~mem9.base, ~bvadd32(4bv32, #t~mem9.offset), 4bv32);#t~short12 := ~bvsle32(#t~mem10, #t~mem11); {1198#|main_#t~short12|} is VALID [2018-11-14 18:17:07,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {1198#|main_#t~short12|} assume !#t~short12;havoc #t~mem11;havoc #t~mem10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~short12;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {1144#false} is VALID [2018-11-14 18:17:07,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2018-11-14 18:17:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:07,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:17:07,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:07,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:17:07,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:17:07,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:07,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:17:07,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:07,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:17:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:17:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=12, Unknown=1, NotChecked=0, Total=20 [2018-11-14 18:17:07,430 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 5 states. [2018-11-14 18:17:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:08,474 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-14 18:17:08,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:17:08,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:17:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-14 18:17:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-14 18:17:08,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-14 18:17:08,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:08,609 INFO L225 Difference]: With dead ends: 57 [2018-11-14 18:17:08,609 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:17:08,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2018-11-14 18:17:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:17:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:17:08,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:08,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:17:08,628 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:17:08,628 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:17:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:08,630 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 18:17:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:17:08,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:08,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:17:08,631 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:17:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:08,633 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 18:17:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:17:08,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:08,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:08,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:08,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:17:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 18:17:08,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 19 [2018-11-14 18:17:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:08,637 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 18:17:08,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:17:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:17:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:17:08,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:08,638 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:08,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:08,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -447608243, now seen corresponding path program 1 times [2018-11-14 18:17:08,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:08,639 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:17:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:08,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:08,780 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:17:08,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:08,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:08,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-14 18:17:08,804 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:08,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:08,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:08,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 18:17:08,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:08,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:17:08,942 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 8 treesize of output 7 [2018-11-14 18:17:08,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:08,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:17:08,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:17:08,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:08,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:17:09,039 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2018-11-14 18:17:09,062 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:09,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-14 18:17:09,249 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 18 treesize of output 9 [2018-11-14 18:17:09,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,266 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:17:09,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,323 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:17:09,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-11-14 18:17:09,328 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:09,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1415#true} is VALID [2018-11-14 18:17:09,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {1415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1415#true} is VALID [2018-11-14 18:17:09,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2018-11-14 18:17:09,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #136#return; {1415#true} is VALID [2018-11-14 18:17:09,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret17 := main(); {1415#true} is VALID [2018-11-14 18:17:09,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {1415#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {1435#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:17:09,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {1435#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume true; {1435#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:17:09,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {1435#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-14 18:17:09,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~x~0.offset (_ BitVec 32))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1467#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:09,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {1467#(not (= (_ bv0 32) main_~x~0.base))} assume true; {1467#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:09,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {1467#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1416#false} is VALID [2018-11-14 18:17:09,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2018-11-14 18:17:09,377 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:17:09,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:17:09,499 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 32 treesize of output 26 [2018-11-14 18:17:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:17:09,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-14 18:17:09,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-14 18:17:09,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-14 18:17:09,689 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:09,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:09,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-14 18:17:09,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:09,775 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 20 treesize of output 24 [2018-11-14 18:17:09,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-14 18:17:09,789 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:09,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:09,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-14 18:17:09,848 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,902 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 13 treesize of output 7 [2018-11-14 18:17:09,905 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:09,930 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:10,036 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:17:10,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-14 18:17:10,099 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:42, output treesize:59 [2018-11-14 18:17:10,108 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:10,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2018-11-14 18:17:10,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {1467#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1416#false} is VALID [2018-11-14 18:17:10,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {1467#(not (= (_ bv0 32) main_~x~0.base))} assume true; {1467#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:10,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1467#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:17:10,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1511#(and (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~x~0.offset main_~head~0.offset)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (or (= v_prenex_3 (_ bv0 32)) (not (= (select |#valid| v_prenex_3) (_ bv0 1)))))))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {1486#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:17:10,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {1511#(and (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~x~0.offset main_~head~0.offset)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (or (= v_prenex_3 (_ bv0 32)) (not (= (select |#valid| v_prenex_3) (_ bv0 1)))))))} assume true; {1511#(and (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~x~0.offset main_~head~0.offset)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (or (= v_prenex_3 (_ bv0 32)) (not (= (select |#valid| v_prenex_3) (_ bv0 1)))))))} is VALID [2018-11-14 18:17:10,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1415#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {1511#(and (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~x~0.offset main_~head~0.offset)) (or (= main_~head~0.base main_~x~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (or (= v_prenex_3 (_ bv0 32)) (not (= (select |#valid| v_prenex_3) (_ bv0 1)))))))} is VALID [2018-11-14 18:17:10,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret17 := main(); {1415#true} is VALID [2018-11-14 18:17:10,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #136#return; {1415#true} is VALID [2018-11-14 18:17:10,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2018-11-14 18:17:10,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {1415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1415#true} is VALID [2018-11-14 18:17:10,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1415#true} is VALID [2018-11-14 18:17:10,424 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:17:10,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:17:10,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 18:17:10,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-14 18:17:10,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:10,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:17:10,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:10,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:17:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:17:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:17:10,473 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2018-11-14 18:17:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:11,366 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2018-11-14 18:17:11,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:17:11,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-14 18:17:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:17:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2018-11-14 18:17:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:17:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2018-11-14 18:17:11,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 86 transitions. [2018-11-14 18:17:11,563 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:17:11,567 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:17:11,567 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 18:17:11,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:17:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 18:17:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 40. [2018-11-14 18:17:11,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:11,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 40 states. [2018-11-14 18:17:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 40 states. [2018-11-14 18:17:11,614 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 40 states. [2018-11-14 18:17:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:11,617 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-14 18:17:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-14 18:17:11,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:11,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:11,618 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 91 states. [2018-11-14 18:17:11,618 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 91 states. [2018-11-14 18:17:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:11,622 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-14 18:17:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-14 18:17:11,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:11,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:11,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:11,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:17:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-14 18:17:11,625 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2018-11-14 18:17:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:11,625 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-14 18:17:11,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:17:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-14 18:17:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:17:11,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:11,626 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:17:11,626 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:11,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2114259192, now seen corresponding path program 1 times [2018-11-14 18:17:11,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:11,627 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:17:11,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:11,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:11,788 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:17:11,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:11,816 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:17:11,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:17:11,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:11,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:11,846 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:17:11,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-14 18:17:11,861 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:11,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:11,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:11,940 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:17:11,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:17:12,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:17:12,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:12,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 18:17:12,183 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 18 treesize of output 16 [2018-11-14 18:17:12,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-14 18:17:12,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 18:17:12,293 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-14 18:17:12,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 18:17:12,338 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,400 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:82, output treesize:56 [2018-11-14 18:17:12,583 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:12,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-14 18:17:12,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-14 18:17:12,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:12,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2018-11-14 18:17:13,181 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 43 treesize of output 46 [2018-11-14 18:17:13,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-14 18:17:13,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:13,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:13,245 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:17:13,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:75 [2018-11-14 18:17:13,541 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-14 18:17:13,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:13,583 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 11 [2018-11-14 18:17:13,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-14 18:17:13,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:13,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:13,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:17:13,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:189, output treesize:61 [2018-11-14 18:17:13,639 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:13,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {1886#true} call ULTIMATE.init(); {1886#true} is VALID [2018-11-14 18:17:13,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {1886#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1886#true} is VALID [2018-11-14 18:17:13,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {1886#true} assume true; {1886#true} is VALID [2018-11-14 18:17:13,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1886#true} {1886#true} #136#return; {1886#true} is VALID [2018-11-14 18:17:13,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {1886#true} call #t~ret17 := main(); {1886#true} is VALID [2018-11-14 18:17:13,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {1886#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {1906#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:17:13,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {1906#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume true; {1906#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-14 18:17:13,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {1906#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {1913#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {1913#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {1913#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1913#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume true; {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume true; {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume true; {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} is VALID [2018-11-14 18:17:13,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd main_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) main_~state~0) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) main_~x~0.offset) main_~x~0.offset))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true; {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} call #t~mem6 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume !!(#t~mem6 != 0bv32);havoc #t~mem6; {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} is VALID [2018-11-14 18:17:13,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {1939#(exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32)))))} assume true;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);#t~short12 := #t~mem8 == 0bv32; {1961#(and (exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))))) |main_#t~short12|)} is VALID [2018-11-14 18:17:13,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {1961#(and (exists ((main_~head~0.base (_ BitVec 32))) (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~x~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))))) |main_#t~short12|)} assume !#t~short12;call #t~mem10 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem11 := read~intINTTYPE4(#t~mem9.base, ~bvadd32(4bv32, #t~mem9.offset), 4bv32);#t~short12 := ~bvsle32(#t~mem10, #t~mem11); {1887#false} is VALID [2018-11-14 18:17:13,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {1887#false} assume !#t~short12;havoc #t~mem11;havoc #t~mem10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~short12;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {1887#false} is VALID [2018-11-14 18:17:13,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {1887#false} assume !false; {1887#false} is VALID [2018-11-14 18:17:13,751 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:17:13,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:17:18,204 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 185 treesize of output 147 [2018-11-14 18:17:20,318 WARN L179 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-14 18:17:20,335 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:17:20,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:20,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 152 [2018-11-14 18:17:20,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 138 treesize of output 137 [2018-11-14 18:17:20,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:21,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 143 [2018-11-14 18:17:21,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 18:17:21,670 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 137 treesize of output 131 [2018-11-14 18:17:21,680 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:17:21,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:21,761 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 13 treesize of output 1 [2018-11-14 18:17:21,761 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:21,813 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:22,249 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 137 treesize of output 137 [2018-11-14 18:17:22,657 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-14 18:17:22,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 118 [2018-11-14 18:17:22,772 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-14 18:17:22,993 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 125 treesize of output 113 [2018-11-14 18:17:23,000 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:23,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:17:23,478 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 126 treesize of output 122 [2018-11-14 18:17:23,508 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 13 treesize of output 1 [2018-11-14 18:17:23,508 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:23,549 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:23,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:23,934 INFO L303 Elim1Store]: Index analysis took 289 ms [2018-11-14 18:17:24,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 145 treesize of output 245 [2018-11-14 18:17:24,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-14 18:17:25,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 154 [2018-11-14 18:17:25,019 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:47,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:47,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:47,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:47,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 174 [2018-11-14 18:17:47,689 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-14 18:18:10,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 153 [2018-11-14 18:18:10,046 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-14 18:18:38,554 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:18:38,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 178 [2018-11-14 18:18:38,572 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.