java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:03:38,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:03:38,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:03:38,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:03:38,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:03:38,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:03:38,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:03:38,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:03:38,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:03:38,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:03:38,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:03:38,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:03:38,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:03:38,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:03:38,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:03:38,141 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:03:38,142 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:03:38,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:03:38,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:03:38,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:03:38,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:03:38,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:03:38,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:03:38,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:03:38,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:03:38,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:03:38,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:03:38,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:03:38,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:03:38,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:03:38,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:03:38,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:03:38,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:03:38,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:03:38,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:03:38,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:03:38,179 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:03:38,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:03:38,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:03:38,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:03:38,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:03:38,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:03:38,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:03:38,204 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:03:38,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:03:38,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:03:38,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:03:38,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:03:38,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:03:38,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:03:38,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:03:38,207 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:03:38,207 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:03:38,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:03:38,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:03:38,208 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:03:38,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:03:38,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:03:38,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:03:38,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:03:38,210 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:03:38,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:03:38,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:03:38,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:03:38,211 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:03:38,211 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:03:38,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:03:38,211 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:03:38,213 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:03:38,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:03:38,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:03:38,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:03:38,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:03:38,299 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:03:38,300 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:03:38,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:38,369 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889347b91/c835f2f2ffcf43509b43e55e8e8f60c8/FLAG995e3d632 [2018-11-18 22:03:38,925 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:03:38,926 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:38,941 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889347b91/c835f2f2ffcf43509b43e55e8e8f60c8/FLAG995e3d632 [2018-11-18 22:03:39,215 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889347b91/c835f2f2ffcf43509b43e55e8e8f60c8 [2018-11-18 22:03:39,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:03:39,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:03:39,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:03:39,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:03:39,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:03:39,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:39" (1/1) ... [2018-11-18 22:03:39,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6ca666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:39, skipping insertion in model container [2018-11-18 22:03:39,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:39" (1/1) ... [2018-11-18 22:03:39,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:03:39,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:03:39,733 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:03:39,760 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:03:39,863 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:03:40,026 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:03:40,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40 WrapperNode [2018-11-18 22:03:40,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:03:40,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:03:40,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:03:40,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:03:40,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... [2018-11-18 22:03:40,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:03:40,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:03:40,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:03:40,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:03:40,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:03:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:03:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:03:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:03:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:03:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:03:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:03:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-18 22:03:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-18 22:03:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_insert [2018-11-18 22:03:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:03:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:03:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:03:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:03:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:03:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:03:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:03:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:03:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:03:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:03:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:03:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:03:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:03:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:03:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:03:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:03:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:03:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:03:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:03:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:03:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:03:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:03:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:03:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:03:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:03:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:03:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:03:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:03:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:03:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:03:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_insert [2018-11-18 22:03:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:03:40,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:03:40,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:03:40,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:03:40,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:03:41,956 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:03:41,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:41 BoogieIcfgContainer [2018-11-18 22:03:41,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:03:41,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:03:41,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:03:41,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:03:41,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:03:39" (1/3) ... [2018-11-18 22:03:41,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400ac7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:41, skipping insertion in model container [2018-11-18 22:03:41,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:40" (2/3) ... [2018-11-18 22:03:41,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400ac7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:41, skipping insertion in model container [2018-11-18 22:03:41,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:41" (3/3) ... [2018-11-18 22:03:41,969 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:41,977 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:03:41,985 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:03:42,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:03:42,038 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:03:42,039 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:03:42,039 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:03:42,039 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:03:42,039 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:03:42,040 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:03:42,040 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:03:42,040 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:03:42,040 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:03:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-18 22:03:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 22:03:42,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:42,069 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:42,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:42,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash -18519527, now seen corresponding path program 1 times [2018-11-18 22:03:42,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:42,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:42,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:42,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:42,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {67#true} is VALID [2018-11-18 22:03:42,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {67#true} is VALID [2018-11-18 22:03:42,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2018-11-18 22:03:42,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #169#return; {67#true} is VALID [2018-11-18 22:03:42,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret29 := main(); {67#true} is VALID [2018-11-18 22:03:42,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {67#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {67#true} is VALID [2018-11-18 22:03:42,386 INFO L256 TraceCheckUtils]: 6: Hoare triple {67#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {67#true} is VALID [2018-11-18 22:03:42,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {67#true} ~len := #in~len;~data := #in~data; {67#true} is VALID [2018-11-18 22:03:42,386 INFO L256 TraceCheckUtils]: 8: Hoare triple {67#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {67#true} is VALID [2018-11-18 22:03:42,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {67#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {67#true} is VALID [2018-11-18 22:03:42,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {67#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {67#true} is VALID [2018-11-18 22:03:42,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {67#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {67#true} is VALID [2018-11-18 22:03:42,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {67#true} assume true; {67#true} is VALID [2018-11-18 22:03:42,388 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {67#true} {67#true} #165#return; {67#true} is VALID [2018-11-18 22:03:42,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {67#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {67#true} is VALID [2018-11-18 22:03:42,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {67#true} assume !true; {68#false} is VALID [2018-11-18 22:03:42,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {68#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {68#false} is VALID [2018-11-18 22:03:42,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {68#false} assume true; {68#false} is VALID [2018-11-18 22:03:42,390 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {68#false} {67#true} #159#return; {68#false} is VALID [2018-11-18 22:03:42,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {68#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {68#false} is VALID [2018-11-18 22:03:42,390 INFO L256 TraceCheckUtils]: 20: Hoare triple {68#false} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {68#false} is VALID [2018-11-18 22:03:42,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {68#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {68#false} is VALID [2018-11-18 22:03:42,391 INFO L256 TraceCheckUtils]: 22: Hoare triple {68#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {68#false} is VALID [2018-11-18 22:03:42,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {68#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {68#false} is VALID [2018-11-18 22:03:42,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {68#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {68#false} is VALID [2018-11-18 22:03:42,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {68#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {68#false} is VALID [2018-11-18 22:03:42,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {68#false} assume true; {68#false} is VALID [2018-11-18 22:03:42,392 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {68#false} {68#false} #155#return; {68#false} is VALID [2018-11-18 22:03:42,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {68#false} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {68#false} is VALID [2018-11-18 22:03:42,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {68#false} assume !true; {68#false} is VALID [2018-11-18 22:03:42,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {68#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32); {68#false} is VALID [2018-11-18 22:03:42,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {68#false} assume true; {68#false} is VALID [2018-11-18 22:03:42,393 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {68#false} {68#false} #161#return; {68#false} is VALID [2018-11-18 22:03:42,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {68#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {68#false} is VALID [2018-11-18 22:03:42,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {68#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {68#false} is VALID [2018-11-18 22:03:42,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {68#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {68#false} is VALID [2018-11-18 22:03:42,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {68#false} assume !false; {68#false} is VALID [2018-11-18 22:03:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:42,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:42,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:42,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:03:42,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-18 22:03:42,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:42,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:03:42,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:42,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:03:42,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:03:42,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:03:42,666 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-18 22:03:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:42,999 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2018-11-18 22:03:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:03:43,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-18 22:03:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:03:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-18 22:03:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:03:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-18 22:03:43,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 148 transitions. [2018-11-18 22:03:43,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:43,527 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:03:43,528 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:03:43,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:03:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:03:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 22:03:43,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:43,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-18 22:03:43,633 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-18 22:03:43,634 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-18 22:03:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:43,641 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 22:03:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 22:03:43,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:43,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:43,642 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-18 22:03:43,643 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-18 22:03:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:43,649 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 22:03:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 22:03:43,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:43,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:43,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:43,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:03:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-18 22:03:43,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 37 [2018-11-18 22:03:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:43,658 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 22:03:43,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:03:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 22:03:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:03:43,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:43,660 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:43,661 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:43,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1595928658, now seen corresponding path program 1 times [2018-11-18 22:03:43,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:43,662 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:43,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:43,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:43,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2018-11-18 22:03:43,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {489#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {489#true} is VALID [2018-11-18 22:03:43,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-18 22:03:43,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #169#return; {489#true} is VALID [2018-11-18 22:03:43,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret29 := main(); {489#true} is VALID [2018-11-18 22:03:43,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {489#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {489#true} is VALID [2018-11-18 22:03:43,920 INFO L256 TraceCheckUtils]: 6: Hoare triple {489#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {489#true} is VALID [2018-11-18 22:03:43,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#true} ~len := #in~len;~data := #in~data; {489#true} is VALID [2018-11-18 22:03:43,920 INFO L256 TraceCheckUtils]: 8: Hoare triple {489#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {489#true} is VALID [2018-11-18 22:03:43,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {489#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {489#true} is VALID [2018-11-18 22:03:43,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {489#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {489#true} is VALID [2018-11-18 22:03:43,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {489#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {489#true} is VALID [2018-11-18 22:03:43,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-18 22:03:43,922 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {489#true} {489#true} #165#return; {489#true} is VALID [2018-11-18 22:03:43,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {489#true} is VALID [2018-11-18 22:03:43,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-18 22:03:43,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {489#true} assume !~bvsgt32(~len, 1bv32); {489#true} is VALID [2018-11-18 22:03:43,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {489#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {489#true} is VALID [2018-11-18 22:03:43,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-18 22:03:43,924 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {489#true} {489#true} #159#return; {489#true} is VALID [2018-11-18 22:03:43,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {489#true} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {489#true} is VALID [2018-11-18 22:03:43,925 INFO L256 TraceCheckUtils]: 21: Hoare triple {489#true} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {489#true} is VALID [2018-11-18 22:03:43,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {489#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {489#true} is VALID [2018-11-18 22:03:43,925 INFO L256 TraceCheckUtils]: 23: Hoare triple {489#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {489#true} is VALID [2018-11-18 22:03:43,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {489#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {489#true} is VALID [2018-11-18 22:03:43,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {489#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {489#true} is VALID [2018-11-18 22:03:43,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {489#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {489#true} is VALID [2018-11-18 22:03:43,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-18 22:03:43,927 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {489#true} {489#true} #155#return; {489#true} is VALID [2018-11-18 22:03:43,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {489#true} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} is VALID [2018-11-18 22:03:43,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} assume true; {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} is VALID [2018-11-18 22:03:43,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} assume !~bvsgt32(~index, 0bv32); {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} is VALID [2018-11-18 22:03:43,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {581#(and (= sll_circular_insert_~snd_to_last~0.base (_ bv0 32)) (= (_ bv0 32) sll_circular_insert_~snd_to_last~0.offset))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32); {490#false} is VALID [2018-11-18 22:03:43,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {490#false} assume true; {490#false} is VALID [2018-11-18 22:03:43,938 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {490#false} {489#true} #161#return; {490#false} is VALID [2018-11-18 22:03:43,938 INFO L273 TraceCheckUtils]: 35: Hoare triple {490#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {490#false} is VALID [2018-11-18 22:03:43,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {490#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {490#false} is VALID [2018-11-18 22:03:43,939 INFO L273 TraceCheckUtils]: 37: Hoare triple {490#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {490#false} is VALID [2018-11-18 22:03:43,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {490#false} assume !false; {490#false} is VALID [2018-11-18 22:03:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 22:03:43,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:03:43,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 22:03:43,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:43,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:03:44,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:44,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:03:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:03:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:03:44,024 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2018-11-18 22:03:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:44,421 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-18 22:03:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:03:44,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 22:03:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:03:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-18 22:03:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:03:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-18 22:03:44,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-18 22:03:44,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:44,615 INFO L225 Difference]: With dead ends: 69 [2018-11-18 22:03:44,615 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 22:03:44,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-18 22:03:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 22:03:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-18 22:03:44,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:44,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-18 22:03:44,641 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-18 22:03:44,641 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-18 22:03:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:44,646 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-18 22:03:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-18 22:03:44,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:44,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:44,648 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-18 22:03:44,648 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-18 22:03:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:44,653 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-18 22:03:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-18 22:03:44,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:44,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:44,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:44,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:03:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-11-18 22:03:44,659 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 39 [2018-11-18 22:03:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:44,660 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-18 22:03:44,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:03:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-18 22:03:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 22:03:44,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:44,662 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:44,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:44,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash -30915848, now seen corresponding path program 1 times [2018-11-18 22:03:44,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:44,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:44,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:44,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2018-11-18 22:03:44,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {873#true} is VALID [2018-11-18 22:03:44,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-18 22:03:44,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #169#return; {873#true} is VALID [2018-11-18 22:03:44,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret29 := main(); {873#true} is VALID [2018-11-18 22:03:44,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {873#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {893#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:44,933 INFO L256 TraceCheckUtils]: 6: Hoare triple {893#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {873#true} is VALID [2018-11-18 22:03:44,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#true} ~len := #in~len;~data := #in~data; {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:03:44,934 INFO L256 TraceCheckUtils]: 8: Hoare triple {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {873#true} is VALID [2018-11-18 22:03:44,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {873#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {873#true} is VALID [2018-11-18 22:03:44,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {873#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {873#true} is VALID [2018-11-18 22:03:44,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {873#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {873#true} is VALID [2018-11-18 22:03:44,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-18 22:03:44,937 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {873#true} {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #165#return; {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:03:44,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:03:44,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:03:44,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:03:44,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:03:44,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:03:44,948 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {928#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {893#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #159#return; {874#false} is VALID [2018-11-18 22:03:44,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {874#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {874#false} is VALID [2018-11-18 22:03:44,949 INFO L256 TraceCheckUtils]: 21: Hoare triple {874#false} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {874#false} is VALID [2018-11-18 22:03:44,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {874#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {874#false} is VALID [2018-11-18 22:03:44,950 INFO L256 TraceCheckUtils]: 23: Hoare triple {874#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {874#false} is VALID [2018-11-18 22:03:44,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {874#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {874#false} is VALID [2018-11-18 22:03:44,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {874#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {874#false} is VALID [2018-11-18 22:03:44,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {874#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {874#false} is VALID [2018-11-18 22:03:44,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {874#false} assume true; {874#false} is VALID [2018-11-18 22:03:44,952 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {874#false} {874#false} #155#return; {874#false} is VALID [2018-11-18 22:03:44,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {874#false} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {874#false} is VALID [2018-11-18 22:03:44,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {874#false} assume true; {874#false} is VALID [2018-11-18 22:03:44,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#false} assume !~bvsgt32(~index, 0bv32); {874#false} is VALID [2018-11-18 22:03:44,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#false} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {874#false} is VALID [2018-11-18 22:03:44,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#false} assume #t~mem12.base != 0bv32 || #t~mem12.offset != 0bv32;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem14.base, #t~mem14.offset, 4bv32);havoc #t~mem14.base, #t~mem14.offset; {874#false} is VALID [2018-11-18 22:03:44,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {874#false} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {874#false} is VALID [2018-11-18 22:03:44,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {874#false} assume true; {874#false} is VALID [2018-11-18 22:03:44,955 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {874#false} {874#false} #161#return; {874#false} is VALID [2018-11-18 22:03:44,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {874#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {874#false} is VALID [2018-11-18 22:03:44,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {874#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {874#false} is VALID [2018-11-18 22:03:44,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {874#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {874#false} is VALID [2018-11-18 22:03:44,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {874#false} assume !false; {874#false} is VALID [2018-11-18 22:03:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:44,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:44,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:03:44,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-18 22:03:44,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:44,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:03:45,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:45,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:03:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:03:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:03:45,062 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 5 states. [2018-11-18 22:03:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:45,930 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-18 22:03:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:03:45,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-18 22:03:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:03:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2018-11-18 22:03:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:03:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2018-11-18 22:03:45,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 105 transitions. [2018-11-18 22:03:46,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:46,205 INFO L225 Difference]: With dead ends: 92 [2018-11-18 22:03:46,206 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 22:03:46,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:03:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 22:03:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-18 22:03:46,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:46,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-18 22:03:46,248 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-18 22:03:46,248 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-18 22:03:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:46,253 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-18 22:03:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-18 22:03:46,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:46,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:46,254 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-18 22:03:46,254 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-18 22:03:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:46,260 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-18 22:03:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-18 22:03:46,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:46,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:46,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:46,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:03:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-11-18 22:03:46,265 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 41 [2018-11-18 22:03:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:46,266 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-11-18 22:03:46,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:03:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-18 22:03:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:03:46,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:46,268 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:46,268 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:46,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1013759915, now seen corresponding path program 1 times [2018-11-18 22:03:46,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:46,269 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:46,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:46,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:46,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2018-11-18 22:03:46,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {1305#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1305#true} is VALID [2018-11-18 22:03:46,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #169#return; {1305#true} is VALID [2018-11-18 22:03:46,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret29 := main(); {1305#true} is VALID [2018-11-18 22:03:46,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {1305#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1325#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:46,701 INFO L256 TraceCheckUtils]: 6: Hoare triple {1325#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1305#true} is VALID [2018-11-18 22:03:46,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {1305#true} ~len := #in~len;~data := #in~data; {1305#true} is VALID [2018-11-18 22:03:46,702 INFO L256 TraceCheckUtils]: 8: Hoare triple {1305#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1305#true} is VALID [2018-11-18 22:03:46,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {1305#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1305#true} is VALID [2018-11-18 22:03:46,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {1305#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1305#true} is VALID [2018-11-18 22:03:46,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {1305#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1305#true} is VALID [2018-11-18 22:03:46,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,703 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1305#true} {1305#true} #165#return; {1305#true} is VALID [2018-11-18 22:03:46,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {1305#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1305#true} is VALID [2018-11-18 22:03:46,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {1305#true} assume !!~bvsgt32(~len, 1bv32); {1305#true} is VALID [2018-11-18 22:03:46,705 INFO L256 TraceCheckUtils]: 17: Hoare triple {1305#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1305#true} is VALID [2018-11-18 22:03:46,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {1305#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1305#true} is VALID [2018-11-18 22:03:46,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {1305#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1305#true} is VALID [2018-11-18 22:03:46,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {1305#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1305#true} is VALID [2018-11-18 22:03:46,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,706 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1305#true} {1305#true} #167#return; {1305#true} is VALID [2018-11-18 22:03:46,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {1305#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1305#true} is VALID [2018-11-18 22:03:46,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {1305#true} assume !~bvsgt32(~len, 1bv32); {1305#true} is VALID [2018-11-18 22:03:46,707 INFO L273 TraceCheckUtils]: 26: Hoare triple {1305#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1305#true} is VALID [2018-11-18 22:03:46,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,709 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1305#true} {1325#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #159#return; {1325#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:46,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {1325#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {1398#(= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:46,712 INFO L256 TraceCheckUtils]: 30: Hoare triple {1398#(= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {1305#true} is VALID [2018-11-18 22:03:46,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {1305#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} is VALID [2018-11-18 22:03:46,713 INFO L256 TraceCheckUtils]: 32: Hoare triple {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1305#true} is VALID [2018-11-18 22:03:46,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {1305#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1305#true} is VALID [2018-11-18 22:03:46,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {1305#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1305#true} is VALID [2018-11-18 22:03:46,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {1305#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1305#true} is VALID [2018-11-18 22:03:46,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 22:03:46,715 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1305#true} {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} #155#return; {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} is VALID [2018-11-18 22:03:46,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} is VALID [2018-11-18 22:03:46,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} assume true; {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} is VALID [2018-11-18 22:03:46,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {1405#(= |sll_circular_insert_#in~index| sll_circular_insert_~index)} assume !~bvsgt32(~index, 0bv32); {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:46,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:46,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} assume #t~mem12.base != 0bv32 || #t~mem12.offset != 0bv32;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem14.base, #t~mem14.offset, 4bv32);havoc #t~mem14.base, #t~mem14.offset; {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:46,721 INFO L273 TraceCheckUtils]: 43: Hoare triple {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:46,721 INFO L273 TraceCheckUtils]: 44: Hoare triple {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} assume true; {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:46,726 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1433#(not (bvsgt |sll_circular_insert_#in~index| (_ bv0 32)))} {1398#(= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))} #161#return; {1306#false} is VALID [2018-11-18 22:03:46,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {1306#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {1306#false} is VALID [2018-11-18 22:03:46,727 INFO L273 TraceCheckUtils]: 47: Hoare triple {1306#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1306#false} is VALID [2018-11-18 22:03:46,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {1306#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {1306#false} is VALID [2018-11-18 22:03:46,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2018-11-18 22:03:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 22:03:46,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:46,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:03:46,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 22:03:46,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:46,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:03:46,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:46,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:03:46,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:03:46,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:03:46,819 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 6 states. [2018-11-18 22:03:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:47,709 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-18 22:03:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:03:47,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 22:03:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:03:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-18 22:03:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:03:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-18 22:03:47,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-18 22:03:47,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:47,901 INFO L225 Difference]: With dead ends: 71 [2018-11-18 22:03:47,901 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 22:03:47,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:03:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 22:03:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-18 22:03:47,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:47,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-18 22:03:47,954 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-18 22:03:47,954 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-18 22:03:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:47,957 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 22:03:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 22:03:47,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:47,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:47,959 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-18 22:03:47,959 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-18 22:03:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:47,962 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 22:03:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 22:03:47,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:47,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:47,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:47,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:03:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-18 22:03:47,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 50 [2018-11-18 22:03:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:47,967 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-18 22:03:47,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:03:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 22:03:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:03:47,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:47,969 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:47,970 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:47,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash -424004801, now seen corresponding path program 1 times [2018-11-18 22:03:47,970 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:47,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:48,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:48,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:48,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:03:48,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:48,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:48,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 22:03:48,349 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:49,324 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-18 22:03:52,451 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 22:03:52,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:03:52,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 22:03:52,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:52,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:52,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:52,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 22:03:54,793 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 22:03:55,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:55,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:55,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:55,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-18 22:03:55,623 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 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 22:03:55,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:55,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:55,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:55,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2018-11-18 22:03:55,690 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:55,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:03:55,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:03:55,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:55,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:56,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:03:56,019 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-18 22:03:56,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:56,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:56,086 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-18 22:03:56,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:67 [2018-11-18 22:03:56,145 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:00,743 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 22:04:02,992 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:04:05,251 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:04:07,539 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:04:09,800 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32)) (sll_circular_insert_~snd_to_last~0.offset (_ BitVec 32))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_circular_insert_#in~head.base|) |c_sll_circular_insert_#in~head.offset|))) (and (= (store |c_old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |c_#memory_int|) (= (_ bv0 1) (select |c_old(#valid)| sll_circular_insert_~new_node~0.base)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)))) (store .cse0 sll_circular_insert_~new_node~0.base (store (select .cse0 sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base)))) (= (let ((.cse3 (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))))) (store .cse4 .cse2 (store (select .cse4 .cse2) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset))))) (store .cse3 sll_circular_insert_~new_node~0.base (store (select .cse3 sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-11-18 22:04:15,208 WARN L180 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-18 22:04:15,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:15,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:15,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:15,503 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:15,504 INFO L303 Elim1Store]: Index analysis took 277 ms [2018-11-18 22:04:15,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 22:04:15,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:17,693 INFO L303 Elim1Store]: Index analysis took 339 ms [2018-11-18 22:04:17,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 166 [2018-11-18 22:04:17,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:04:17,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:19,186 INFO L303 Elim1Store]: Index analysis took 558 ms [2018-11-18 22:04:19,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 148 [2018-11-18 22:04:19,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 22:04:19,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:20,201 INFO L303 Elim1Store]: Index analysis took 418 ms [2018-11-18 22:04:20,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 142 [2018-11-18 22:04:20,433 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 14 treesize of output 19 [2018-11-18 22:04:20,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:21,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:22,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:22,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:24,170 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-18 22:04:24,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 154 [2018-11-18 22:04:24,194 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 18 treesize of output 17 [2018-11-18 22:04:24,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:24,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:24,574 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-11-18 22:04:24,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 150 [2018-11-18 22:04:24,593 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 18 treesize of output 17 [2018-11-18 22:04:24,595 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:24,791 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:25,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 148 [2018-11-18 22:04:25,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:04:25,729 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:26,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 82 [2018-11-18 22:04:26,064 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-18 22:04:26,067 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:26,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 87 [2018-11-18 22:04:26,261 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 22 treesize of output 51 [2018-11-18 22:04:26,265 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:26,341 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:26,414 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:26,581 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:26,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 144 [2018-11-18 22:04:26,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:04:26,664 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:26,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 82 [2018-11-18 22:04:26,911 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-18 22:04:26,913 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 87 [2018-11-18 22:04:27,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-18 22:04:27,124 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,179 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,247 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,324 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 22:04:27,854 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 12 variables, input treesize:301, output treesize:157 [2018-11-18 22:04:28,805 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:29,082 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-11-18 22:04:29,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:04:29,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:04:29,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,184 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 55 treesize of output 35 [2018-11-18 22:04:29,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:04:29,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,214 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 21 treesize of output 12 [2018-11-18 22:04:29,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,241 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:74, output treesize:16 [2018-11-18 22:04:29,248 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:29,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:04:29,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:04:29,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:29,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-18 22:04:29,411 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:29,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {1732#true} call ULTIMATE.init(); {1732#true} is VALID [2018-11-18 22:04:29,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {1732#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1732#true} is VALID [2018-11-18 22:04:29,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {1732#true} assume true; {1732#true} is VALID [2018-11-18 22:04:29,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1732#true} {1732#true} #169#return; {1732#true} is VALID [2018-11-18 22:04:29,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {1732#true} call #t~ret29 := main(); {1732#true} is VALID [2018-11-18 22:04:29,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1752#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:04:29,515 INFO L256 TraceCheckUtils]: 6: Hoare triple {1752#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:04:29,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,517 INFO L256 TraceCheckUtils]: 8: Hoare triple {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:04:29,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:04:29,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:04:29,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:04:29,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:04:29,531 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} #165#return; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} assume true; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} assume !!~bvsgt32(~len, 1bv32); {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,533 INFO L256 TraceCheckUtils]: 17: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:04:29,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:04:29,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:04:29,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:29,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:29,544 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} #167#return; {1810#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base|)))) (= |sll_circular_create_#in~data| (select (select |#memory_int| |sll_circular_create_#t~ret4.base|) (bvadd |sll_circular_create_#t~ret4.offset| (_ bv4 32)))) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:29,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base|)))) (= |sll_circular_create_#in~data| (select (select |#memory_int| |sll_circular_create_#t~ret4.base|) (bvadd |sll_circular_create_#t~ret4.offset| (_ bv4 32)))) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} assume true; {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} assume !~bvsgt32(~len, 1bv32); {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} assume true; {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:04:29,564 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} {1752#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #159#return; {1831#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret15.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_#t~ret15.offset| (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| |main_#t~ret15.base|) (_ bv4 32))))} is VALID [2018-11-18 22:04:29,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {1831#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret15.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_#t~ret15.offset| (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| |main_#t~ret15.base|) (_ bv4 32))))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {1835#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:04:29,589 INFO L256 TraceCheckUtils]: 30: Hoare triple {1835#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:04:29,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:04:29,592 INFO L256 TraceCheckUtils]: 32: Hoare triple {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:04:29,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1850#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:04:29,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {1850#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1850#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:04:29,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {1850#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1857#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|))))} is VALID [2018-11-18 22:04:29,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|))))} assume true; {1857#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|))))} is VALID [2018-11-18 22:04:29,606 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1857#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|))))} {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #155#return; {1864#(and (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_int)| |sll_circular_insert_#t~ret8.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|))) (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= (_ bv0 1) (select |old(#valid)| |sll_circular_insert_#t~ret8.base|)))} is VALID [2018-11-18 22:04:29,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {1864#(and (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_int)| |sll_circular_insert_#t~ret8.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|))) (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= (_ bv0 1) (select |old(#valid)| |sll_circular_insert_#t~ret8.base|)))} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1868#(and (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))))} is VALID [2018-11-18 22:04:29,611 INFO L273 TraceCheckUtils]: 39: Hoare triple {1868#(and (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))))} assume true; {1868#(and (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))))} is VALID [2018-11-18 22:04:29,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {1868#(and (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))))} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~1.base, ~last~1.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~last~1.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;#t~post11 := ~index;~index := ~bvsub32(#t~post11, 1bv32);havoc #t~post11; {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} is VALID [2018-11-18 22:04:29,616 INFO L273 TraceCheckUtils]: 41: Hoare triple {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} assume true; {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} is VALID [2018-11-18 22:04:29,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} assume !~bvsgt32(~index, 0bv32); {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} is VALID [2018-11-18 22:04:31,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {1875#(and (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32)))))) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32); {1885#(exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32)) (sll_circular_insert_~snd_to_last~0.offset (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset)) |#memory_$Pointer$.offset|)))} is UNKNOWN [2018-11-18 22:04:31,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {1885#(exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32)) (sll_circular_insert_~snd_to_last~0.offset (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset)) |#memory_$Pointer$.offset|)))} assume true; {1885#(exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32)) (sll_circular_insert_~snd_to_last~0.offset (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset)) |#memory_$Pointer$.offset|)))} is VALID [2018-11-18 22:04:31,640 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1885#(exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32)) (sll_circular_insert_~snd_to_last~0.offset (_ BitVec 32))) (and (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) node_create_~data)) |#memory_int|) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) sll_circular_insert_~snd_to_last~0.offset sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset)) |#memory_$Pointer$.offset|)))} {1835#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #161#return; {1892#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) v_prenex_1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) v_prenex_1))))))} is VALID [2018-11-18 22:04:31,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {1892#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) v_prenex_1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) v_prenex_1))))))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {1896#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:04:31,643 INFO L273 TraceCheckUtils]: 47: Hoare triple {1896#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1900#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:04:31,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {1900#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem18;havoc #t~mem18; {1733#false} is VALID [2018-11-18 22:04:31,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {1733#false} assume !false; {1733#false} is VALID [2018-11-18 22:04:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2018-11-18 22:04:31,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:04:32,320 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 22:04:32,570 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 22:04:32,735 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 22:04:35,113 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-18 22:04:36,077 WARN L180 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 22:04:38,649 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-18 22:04:40,216 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-18 22:04:41,822 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-18 22:05:03,919 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:05:03,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:05:03,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:05:03,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:04,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:04,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:05:04,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:04,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:04,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:05:04,096 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:06,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:05:06,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 22:05:06,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 22:05:06,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:06,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:06,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:06,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-18 22:05:06,704 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 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 22:05:06,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:06,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:42 [2018-11-18 22:05:06,806 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:07,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:05:07,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:05:07,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:07,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:07,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:05:07,178 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-18 22:05:07,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:07,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:07,241 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-18 22:05:07,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2018-11-18 22:05:07,331 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:14,166 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 22:05:18,874 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 22:05:23,911 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:05:28,845 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:06:20,999 WARN L180 SmtUtils]: Spent 4.65 s on a formula simplification that was a NOOP. DAG size: 91 [2018-11-18 22:06:47,950 WARN L180 SmtUtils]: Spent 26.80 s on a formula simplification. DAG size of input: 255 DAG size of output: 72 [2018-11-18 22:06:48,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:48,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:48,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:06:48,177 INFO L303 Elim1Store]: Index analysis took 211 ms [2018-11-18 22:06:48,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 22:06:48,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:50,429 INFO L303 Elim1Store]: Index analysis took 408 ms [2018-11-18 22:06:50,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 154 [2018-11-18 22:06:50,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:06:50,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:51,624 INFO L303 Elim1Store]: Index analysis took 458 ms [2018-11-18 22:06:51,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 145 [2018-11-18 22:06:51,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:06:51,664 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:52,648 INFO L303 Elim1Store]: Index analysis took 334 ms [2018-11-18 22:06:52,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 139 [2018-11-18 22:06:52,761 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 14 treesize of output 43 [2018-11-18 22:06:52,767 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 22:06:53,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:54,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:54,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:56,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 164 [2018-11-18 22:06:56,082 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 18 treesize of output 16 [2018-11-18 22:06:56,084 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:56,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 140 [2018-11-18 22:06:56,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 22:06:56,434 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:56,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:56,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 127 [2018-11-18 22:06:56,773 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 82 [2018-11-18 22:06:56,788 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-18 22:06:56,976 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:57,152 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:57,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:57,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:57,517 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-18 22:06:57,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 172 [2018-11-18 22:06:57,537 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 18 treesize of output 16 [2018-11-18 22:06:57,539 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:57,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,008 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-18 22:06:58,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 155 [2018-11-18 22:06:58,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 22:06:58,032 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 142 [2018-11-18 22:06:58,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:06:58,314 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 101 [2018-11-18 22:06:58,324 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 22:06:58,450 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,514 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,580 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 134 [2018-11-18 22:06:58,889 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 20 treesize of output 19 [2018-11-18 22:06:58,890 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,959 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:58,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:58,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 145 [2018-11-18 22:06:59,008 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 20 treesize of output 19 [2018-11-18 22:06:59,009 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:59,091 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:59,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:06:59,356 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 20 variables, input treesize:713, output treesize:166 [2018-11-18 22:07:01,382 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:07:03,049 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 22:07:03,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 98 [2018-11-18 22:07:03,247 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 22:07:03,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-18 22:07:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 22:07:03,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-11-18 22:07:03,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:07:03,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:07:03,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-18 22:07:03,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:07:03,603 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,627 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,735 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 92 treesize of output 84 [2018-11-18 22:07:03,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 22:07:03,745 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,813 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 38 treesize of output 29 [2018-11-18 22:07:03,815 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:03,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-18 22:07:03,954 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-11-18 22:07:03,963 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:03,990 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 27 treesize of output 16 [2018-11-18 22:07:03,994 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:04,008 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:04,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:04,057 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:172, output treesize:15 [2018-11-18 22:07:04,069 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:07:05,294 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-18 22:07:05,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:07:05,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:05,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:05,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:05,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-11-18 22:07:05,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:07:05,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {1732#true} call ULTIMATE.init(); {1732#true} is VALID [2018-11-18 22:07:05,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {1732#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1732#true} is VALID [2018-11-18 22:07:05,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {1732#true} assume true; {1732#true} is VALID [2018-11-18 22:07:05,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1732#true} {1732#true} #169#return; {1732#true} is VALID [2018-11-18 22:07:05,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {1732#true} call #t~ret29 := main(); {1732#true} is VALID [2018-11-18 22:07:05,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1941#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:07:05,325 INFO L256 TraceCheckUtils]: 6: Hoare triple {1941#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:07:05,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,329 INFO L256 TraceCheckUtils]: 8: Hoare triple {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:07:05,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:07:05,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:07:05,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:07:05,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:07:05,335 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1767#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {1760#(and (= |#valid| |old(#valid)|) (= sll_circular_create_~data |sll_circular_create_#in~data|))} #165#return; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} assume true; {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} assume !!~bvsgt32(~len, 1bv32); {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,341 INFO L256 TraceCheckUtils]: 17: Hoare triple {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1756#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:07:05,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:07:05,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:07:05,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1796#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:07:05,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:07:05,350 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1803#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {1780#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (= sll_circular_create_~data |sll_circular_create_#in~data|))} #167#return; {1810#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base|)))) (= |sll_circular_create_#in~data| (select (select |#memory_int| |sll_circular_create_#t~ret4.base|) (bvadd |sll_circular_create_#t~ret4.offset| (_ bv4 32)))) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)))} is VALID [2018-11-18 22:07:05,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#t~ret4.base|)))) (= |sll_circular_create_#in~data| (select (select |#memory_int| |sll_circular_create_#t~ret4.base|) (bvadd |sll_circular_create_#t~ret4.offset| (_ bv4 32)))) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} assume true; {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} assume !~bvsgt32(~len, 1bv32); {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {1814#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (= (select (select |#memory_int| sll_circular_create_~head~0.base) (bvadd sll_circular_create_~head~0.offset (_ bv4 32))) |sll_circular_create_#in~data|))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} assume true; {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} is VALID [2018-11-18 22:07:05,369 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1824#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_circular_create_#res.base|)))) (= (select (select |#memory_int| |sll_circular_create_#res.base|) (_ bv4 32)) |sll_circular_create_#in~data|))} {1941#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #159#return; {2011#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret15.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_#t~ret15.offset| (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= main_~data~0 (select (select |#memory_int| |main_#t~ret15.base|) (_ bv4 32))))} is VALID [2018-11-18 22:07:05,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {2011#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret15.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_#t~ret15.offset| (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (= main_~data~0 (select (select |#memory_int| |main_#t~ret15.base|) (_ bv4 32))))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32;~mid_index~0 := ~bvsdiv32(~len~0, 2bv32); {2015#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:07:05,389 INFO L256 TraceCheckUtils]: 30: Hoare triple {2015#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:05,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:05,410 INFO L256 TraceCheckUtils]: 32: Hoare triple {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:05,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {1839#(and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2028#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:07:05,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {2028#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2028#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:07:05,445 INFO L273 TraceCheckUtils]: 35: Hoare triple {2028#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2035#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:07:05,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {2035#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {2035#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:07:05,450 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2035#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |node_create_#res.base| (store (select |old(#memory_int)| |node_create_#res.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1843#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #155#return; {2042#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_int)| |sll_circular_insert_#t~ret8.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |sll_circular_insert_#t~ret8.base|)) (= (store |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|))} is VALID [2018-11-18 22:07:05,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {2042#(and (= |sll_circular_insert_#in~head.base| sll_circular_insert_~head.base) (= |sll_circular_insert_#in~head.offset| sll_circular_insert_~head.offset) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_int)| |sll_circular_insert_#t~ret8.base|) (_ bv4 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| |sll_circular_insert_#t~ret8.base|)) (= (store |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_insert_#t~ret8.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_insert_#t~ret8.base|) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|))} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2046#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~last~1.offset (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} is VALID [2018-11-18 22:07:05,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {2046#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~last~1.offset (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} assume true; {2046#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~last~1.offset (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} is VALID [2018-11-18 22:07:05,470 INFO L273 TraceCheckUtils]: 40: Hoare triple {2046#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= sll_circular_insert_~last~1.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~last~1.offset (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~1.base, ~last~1.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~last~1.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;#t~post11 := ~index;~index := ~bvsub32(#t~post11, 1bv32);havoc #t~post11; {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} is VALID [2018-11-18 22:07:05,471 INFO L273 TraceCheckUtils]: 41: Hoare triple {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} assume true; {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} is VALID [2018-11-18 22:07:05,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} assume !~bvsgt32(~index, 0bv32); {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} is VALID [2018-11-18 22:07:07,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {2053#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= sll_circular_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|)))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32); {2063#(or (exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.offset| (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (and (not (= (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| v_prenex_6)) (= (store |old(#memory_int)| v_prenex_6 (store (select |old(#memory_int)| v_prenex_6) (_ bv4 32) v_prenex_3)) |#memory_int|) (= (store (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6) v_prenex_2 v_prenex_5)) |#memory_$Pointer$.base|) (= (store (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6) v_prenex_2 v_prenex_4)) |#memory_$Pointer$.offset|))))} is UNKNOWN [2018-11-18 22:07:07,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {2063#(or (exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.offset| (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (and (not (= (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| v_prenex_6)) (= (store |old(#memory_int)| v_prenex_6 (store (select |old(#memory_int)| v_prenex_6) (_ bv4 32) v_prenex_3)) |#memory_int|) (= (store (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6) v_prenex_2 v_prenex_5)) |#memory_$Pointer$.base|) (= (store (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6) v_prenex_2 v_prenex_4)) |#memory_$Pointer$.offset|))))} assume true; {2063#(or (exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.offset| (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (and (not (= (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| v_prenex_6)) (= (store |old(#memory_int)| v_prenex_6 (store (select |old(#memory_int)| v_prenex_6) (_ bv4 32) v_prenex_3)) |#memory_int|) (= (store (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6) v_prenex_2 v_prenex_5)) |#memory_$Pointer$.base|) (= (store (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6) v_prenex_2 v_prenex_4)) |#memory_$Pointer$.offset|))))} is VALID [2018-11-18 22:07:07,496 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2063#(or (exists ((sll_circular_insert_~last~1.offset (_ BitVec 32)) (sll_circular_insert_~last~1.base (_ BitVec 32)) (sll_circular_insert_~new_node~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_circular_insert_~new_node~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.base)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.base))) (= (_ bv0 1) (select |old(#valid)| sll_circular_insert_~new_node~0.base)) (= |#memory_$Pointer$.offset| (store (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base (store (select (store (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) sll_circular_insert_~new_node~0.offset)) sll_circular_insert_~new_node~0.base) sll_circular_insert_~new_node~0.offset sll_circular_insert_~last~1.offset))) (= (store |old(#memory_int)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_int)| sll_circular_insert_~new_node~0.base) (_ bv4 32) node_create_~data)) |#memory_int|) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (and (not (= (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| v_prenex_6)) (= (store |old(#memory_int)| v_prenex_6 (store (select |old(#memory_int)| v_prenex_6) (_ bv4 32) v_prenex_3)) |#memory_int|) (= (store (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_6)) v_prenex_6) v_prenex_2 v_prenex_5)) |#memory_$Pointer$.base|) (= (store (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6 (store (select (store (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| v_prenex_6 (store (select |old(#memory_$Pointer$.base)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|)) (select (select (store |old(#memory_$Pointer$.offset)| v_prenex_6 (store (select |old(#memory_$Pointer$.offset)| v_prenex_6) (_ bv0 32) (_ bv0 32))) |sll_circular_insert_#in~head.base|) |sll_circular_insert_#in~head.offset|) v_prenex_2)) v_prenex_6) v_prenex_2 v_prenex_4)) |#memory_$Pointer$.offset|))))} {2015#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #161#return; {2070#(or (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_~#s~0.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)))))} is VALID [2018-11-18 22:07:07,498 INFO L273 TraceCheckUtils]: 46: Hoare triple {2070#(or (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_~#s~0.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)))))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {2074#(and (not (= (_ bv0 32) main_~ptr~0.base)) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:07:07,499 INFO L273 TraceCheckUtils]: 47: Hoare triple {2074#(and (not (= (_ bv0 32) main_~ptr~0.base)) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= main_~ptr~0.offset (_ bv0 32)))} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1910#(= |main_#t~mem18| main_~data~0)} is VALID [2018-11-18 22:07:07,499 INFO L273 TraceCheckUtils]: 48: Hoare triple {1910#(= |main_#t~mem18| main_~data~0)} assume ~data~0 != #t~mem18;havoc #t~mem18; {1733#false} is VALID [2018-11-18 22:07:07,500 INFO L273 TraceCheckUtils]: 49: Hoare triple {1733#false} assume !false; {1733#false} is VALID [2018-11-18 22:07:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2018-11-18 22:07:07,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:07:07,865 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 22:07:08,052 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 22:07:08,291 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:07:08,516 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 22:07:11,272 WARN L180 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 90 [2018-11-18 22:07:12,186 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-18 22:07:15,099 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 22:07:17,602 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-18 22:07:21,793 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked.