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_append_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:31:49,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:31:49,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:31:49,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:31:49,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:31:49,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:31:49,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:31:49,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:31:49,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:31:49,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:31:49,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:31:49,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:31:49,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:31:49,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:31:49,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:31:49,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:31:49,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:31:49,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:31:49,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:31:49,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:31:49,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:31:49,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:31:49,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:31:49,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:31:49,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:31:49,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:31:49,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:31:49,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:31:49,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:31:49,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:31:49,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:31:49,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:31:49,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:31:49,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:31:49,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:31:49,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:31:49,624 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-14 16:31:49,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:31:49,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:31:49,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:31:49,643 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:31:49,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:31:49,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:31:49,644 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:31:49,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:31:49,644 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:31:49,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:31:49,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:31:49,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:31:49,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:31:49,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:31:49,646 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:31:49,646 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:31:49,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:31:49,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:31:49,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:31:49,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:31:49,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:31:49,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:31:49,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:31:49,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:31:49,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:31:49,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:31:49,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:31:49,648 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:31:49,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:31:49,649 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:31:49,649 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:31:49,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:31:49,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:31:49,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:31:49,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:31:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:31:49,711 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:31:49,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:31:49,773 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3585b015/3f67de4d6be74eae91f473415af3aa5d/FLAG9622b2c16 [2018-11-14 16:31:50,361 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:31:50,363 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:31:50,378 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3585b015/3f67de4d6be74eae91f473415af3aa5d/FLAG9622b2c16 [2018-11-14 16:31:50,394 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3585b015/3f67de4d6be74eae91f473415af3aa5d [2018-11-14 16:31:50,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:31:50,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:31:50,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:31:50,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:31:50,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:31:50,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:31:50" (1/1) ... [2018-11-14 16:31:50,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0ab5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:50, skipping insertion in model container [2018-11-14 16:31:50,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:31:50" (1/1) ... [2018-11-14 16:31:50,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:31:50,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:31:50,932 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:31:50,954 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:31:51,026 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:31:51,176 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:31:51,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51 WrapperNode [2018-11-14 16:31:51,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:31:51,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:31:51,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:31:51,178 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:31:51,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... [2018-11-14 16:31:51,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:31:51,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:31:51,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:31:51,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:31:51,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:31:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:31:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:31:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:31:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:31:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:31:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 16:31:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-14 16:31:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-14 16:31:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-11-14 16:31:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:31:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:31:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:31:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:31:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:31:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:31:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:31:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:31:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:31:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:31:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:31:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:31:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:31:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:31:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:31:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:31:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:31:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:31:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-14 16:31:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-14 16:31:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:31:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:31:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-11-14 16:31:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:31:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:31:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:31:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:31:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:31:52,650 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:31:52,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:31:52 BoogieIcfgContainer [2018-11-14 16:31:52,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:31:52,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:31:52,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:31:52,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:31:52,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:31:50" (1/3) ... [2018-11-14 16:31:52,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55450426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:31:52, skipping insertion in model container [2018-11-14 16:31:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:51" (2/3) ... [2018-11-14 16:31:52,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55450426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:31:52, skipping insertion in model container [2018-11-14 16:31:52,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:31:52" (3/3) ... [2018-11-14 16:31:52,659 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:31:52,670 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:31:52,679 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:31:52,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:31:52,732 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:31:52,733 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:31:52,733 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:31:52,734 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:31:52,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:31:52,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:31:52,734 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:31:52,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:31:52,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:31:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-14 16:31:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 16:31:52,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:31:52,773 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] [2018-11-14 16:31:52,776 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:31:52,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:31:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 957752791, now seen corresponding path program 1 times [2018-11-14 16:31:52,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:31:52,793 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:31:52,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:31:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:52,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:31:53,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {61#true} call ULTIMATE.init(); {61#true} is VALID [2018-11-14 16:31:53,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {61#true} is VALID [2018-11-14 16:31:53,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 16:31:53,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61#true} {61#true} #139#return; {61#true} is VALID [2018-11-14 16:31:53,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {61#true} call #t~ret22 := main(); {61#true} is VALID [2018-11-14 16:31:53,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {61#true} is VALID [2018-11-14 16:31:53,083 INFO L256 TraceCheckUtils]: 6: Hoare triple {61#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {61#true} is VALID [2018-11-14 16:31:53,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#true} ~len := #in~len;~data := #in~data; {61#true} is VALID [2018-11-14 16:31:53,084 INFO L256 TraceCheckUtils]: 8: Hoare triple {61#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {61#true} is VALID [2018-11-14 16:31:53,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#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; {61#true} is VALID [2018-11-14 16:31:53,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {61#true} is VALID [2018-11-14 16:31:53,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#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; {61#true} is VALID [2018-11-14 16:31:53,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 16:31:53,085 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {61#true} {61#true} #135#return; {61#true} is VALID [2018-11-14 16:31:53,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#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; {61#true} is VALID [2018-11-14 16:31:53,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#true} assume !true; {62#false} is VALID [2018-11-14 16:31:53,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {62#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; {62#false} is VALID [2018-11-14 16:31:53,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 16:31:53,087 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {62#false} {61#true} #129#return; {62#false} is VALID [2018-11-14 16:31:53,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {62#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {62#false} is VALID [2018-11-14 16:31:53,088 INFO L256 TraceCheckUtils]: 20: Hoare triple {62#false} call sll_circular_append(~#s~0.base, ~#s~0.offset, ~data~0); {62#false} is VALID [2018-11-14 16:31:53,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {62#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {62#false} is VALID [2018-11-14 16:31:53,088 INFO L256 TraceCheckUtils]: 22: Hoare triple {62#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {62#false} is VALID [2018-11-14 16:31:53,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {62#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; {62#false} is VALID [2018-11-14 16:31:53,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {62#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {62#false} is VALID [2018-11-14 16:31:53,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {62#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; {62#false} is VALID [2018-11-14 16:31:53,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 16:31:53,089 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {62#false} {62#false} #127#return; {62#false} is VALID [2018-11-14 16:31:53,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {62#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {62#false} is VALID [2018-11-14 16:31:53,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {62#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset, 4bv32);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {62#false} is VALID [2018-11-14 16:31:53,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 16:31:53,090 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {62#false} {62#false} #131#return; {62#false} is VALID [2018-11-14 16:31:53,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {62#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; {62#false} is VALID [2018-11-14 16:31:53,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {62#false} assume !true; {62#false} is VALID [2018-11-14 16:31:53,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {62#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {62#false} is VALID [2018-11-14 16:31:53,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {62#false} assume !false; {62#false} is VALID [2018-11-14 16:31:53,099 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-14 16:31:53,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:31:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:31:53,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:31:53,116 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 16:31:53,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:31:53,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:31:53,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:31:53,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:31:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:31:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:31:53,544 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-14 16:31:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:54,313 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-14 16:31:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:31:54,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 16:31:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:31:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:31:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 16:31:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:31:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 16:31:54,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 126 transitions. [2018-11-14 16:31:54,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:31:54,770 INFO L225 Difference]: With dead ends: 102 [2018-11-14 16:31:54,771 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 16:31:54,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:31:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 16:31:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 16:31:54,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:31:54,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 16:31:54,844 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:31:54,844 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:31:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:54,851 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 16:31:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 16:31:54,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:31:54,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:31:54,853 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:31:54,853 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:31:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:54,859 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 16:31:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 16:31:54,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:31:54,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:31:54,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:31:54,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:31:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:31:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 16:31:54,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2018-11-14 16:31:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:31:54,867 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 16:31:54,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:31:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 16:31:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:31:54,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:31:54,869 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-14 16:31:54,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:31:54,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:31:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash -647662921, now seen corresponding path program 1 times [2018-11-14 16:31:54,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:31:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:31:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:31:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:55,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:31:55,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-14 16:31:55,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-14 16:31:55,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-14 16:31:55,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #139#return; {447#true} is VALID [2018-11-14 16:31:55,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret22 := main(); {447#true} is VALID [2018-11-14 16:31:55,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:31:55,380 INFO L256 TraceCheckUtils]: 6: Hoare triple {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {447#true} is VALID [2018-11-14 16:31:55,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {447#true} ~len := #in~len;~data := #in~data; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:31:55,383 INFO L256 TraceCheckUtils]: 8: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {447#true} is VALID [2018-11-14 16:31:55,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#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; {447#true} is VALID [2018-11-14 16:31:55,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {447#true} is VALID [2018-11-14 16:31:55,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#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; {447#true} is VALID [2018-11-14 16:31:55,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-14 16:31:55,388 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {447#true} {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #135#return; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:31:55,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {474#(= |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; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:31:55,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:31:55,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:31:55,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {502#(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; {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:31:55,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:31:55,402 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #129#return; {448#false} is VALID [2018-11-14 16:31:55,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {448#false} is VALID [2018-11-14 16:31:55,403 INFO L256 TraceCheckUtils]: 21: Hoare triple {448#false} call sll_circular_append(~#s~0.base, ~#s~0.offset, ~data~0); {448#false} is VALID [2018-11-14 16:31:55,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {448#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {448#false} is VALID [2018-11-14 16:31:55,404 INFO L256 TraceCheckUtils]: 23: Hoare triple {448#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {448#false} is VALID [2018-11-14 16:31:55,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {448#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; {448#false} is VALID [2018-11-14 16:31:55,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {448#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {448#false} is VALID [2018-11-14 16:31:55,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {448#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; {448#false} is VALID [2018-11-14 16:31:55,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {448#false} assume true; {448#false} is VALID [2018-11-14 16:31:55,406 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {448#false} {448#false} #127#return; {448#false} is VALID [2018-11-14 16:31:55,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {448#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {448#false} is VALID [2018-11-14 16:31:55,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {448#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset, 4bv32);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {448#false} is VALID [2018-11-14 16:31:55,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {448#false} assume true; {448#false} is VALID [2018-11-14 16:31:55,408 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {448#false} {448#false} #131#return; {448#false} is VALID [2018-11-14 16:31:55,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {448#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; {448#false} is VALID [2018-11-14 16:31:55,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {448#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {448#false} is VALID [2018-11-14 16:31:55,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {448#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {448#false} is VALID [2018-11-14 16:31:55,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-14 16:31:55,411 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-14 16:31:55,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:31:55,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:31:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:31:55,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:31:55,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:31:55,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:31:55,500 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-14 16:31:55,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:31:55,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:31:55,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:31:55,502 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-14 16:31:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:56,183 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 16:31:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:31:56,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:31:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:31:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:31:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 16:31:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:31:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 16:31:56,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-14 16:31:56,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:31:56,375 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:31:56,375 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 16:31:56,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:31:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 16:31:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-14 16:31:56,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:31:56,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-14 16:31:56,399 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-14 16:31:56,400 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-14 16:31:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:56,404 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 16:31:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 16:31:56,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:31:56,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:31:56,405 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-14 16:31:56,405 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-14 16:31:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:31:56,410 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 16:31:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 16:31:56,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:31:56,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:31:56,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:31:56,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:31:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:31:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-14 16:31:56,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 37 [2018-11-14 16:31:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:31:56,416 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-14 16:31:56,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:31:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 16:31:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 16:31:56,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:31:56,418 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] [2018-11-14 16:31:56,419 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:31:56,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:31:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -64308390, now seen corresponding path program 1 times [2018-11-14 16:31:56,420 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:31:56,420 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:31:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:31:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:31:56,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:31:56,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:31:56,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:31:56,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:31:56,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:56,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:56,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 16:31:57,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:31:57,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:31:57,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,343 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-14 16:31:57,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-14 16:31:57,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-14 16:31:57,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-14 16:31:57,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 16:31:57,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 43 [2018-11-14 16:31:57,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-14 16:31:57,809 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:31:57,994 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:58,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:58,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:31:58,029 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:62, output treesize:45 [2018-11-14 16:32:03,590 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:03,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-14 16:32:03,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-14 16:32:03,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:03,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:32:03,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:03,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2018-11-14 16:32:03,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-14 16:32:03,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-14 16:32:04,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 16:32:04,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,056 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:64, output treesize:16 [2018-11-14 16:32:04,064 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:04,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:32:04,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:32:04,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:04,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-14 16:32:04,160 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:04,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-14 16:32:04,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {816#true} is VALID [2018-11-14 16:32:04,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #139#return; {816#true} is VALID [2018-11-14 16:32:04,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret22 := main(); {816#true} is VALID [2018-11-14 16:32:04,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {816#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:32:04,214 INFO L256 TraceCheckUtils]: 6: Hoare triple {836#(and (= |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); {816#true} is VALID [2018-11-14 16:32:04,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#true} ~len := #in~len;~data := #in~data; {816#true} is VALID [2018-11-14 16:32:04,215 INFO L256 TraceCheckUtils]: 8: Hoare triple {816#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {816#true} is VALID [2018-11-14 16:32:04,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {816#true} is VALID [2018-11-14 16:32:04,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,216 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {816#true} {816#true} #135#return; {816#true} is VALID [2018-11-14 16:32:04,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {816#true} assume !!~bvsgt32(~len, 1bv32); {816#true} is VALID [2018-11-14 16:32:04,217 INFO L256 TraceCheckUtils]: 17: Hoare triple {816#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {816#true} is VALID [2018-11-14 16:32:04,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {816#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {816#true} is VALID [2018-11-14 16:32:04,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,218 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {816#true} {816#true} #137#return; {816#true} is VALID [2018-11-14 16:32:04,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {816#true} assume !~bvsgt32(~len, 1bv32); {816#true} is VALID [2018-11-14 16:32:04,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {816#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; {816#true} is VALID [2018-11-14 16:32:04,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 16:32:04,221 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {816#true} {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #129#return; {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:32:04,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 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; {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:32:04,222 INFO L256 TraceCheckUtils]: 30: Hoare triple {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call sll_circular_append(~#s~0.base, ~#s~0.offset, ~data~0); {816#true} is VALID [2018-11-14 16:32:04,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {816#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {915#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= sll_circular_append_~data |sll_circular_append_#in~data|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:04,226 INFO L256 TraceCheckUtils]: 32: Hoare triple {915#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= sll_circular_append_~data |sll_circular_append_#in~data|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {816#true} is VALID [2018-11-14 16:32:04,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {816#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; {922#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:32:04,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {922#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {922#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:32:04,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {922#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} 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; {929#(and (= (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-14 16:32:04,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {929#(and (= (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; {929#(and (= (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-14 16:32:04,234 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {929#(and (= (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)))} {915#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= sll_circular_append_~data |sll_circular_append_#in~data|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} #127#return; {936#(and (= |sll_circular_append_#t~ret8.offset| (_ bv0 32)) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select (select |#memory_int| |sll_circular_append_#t~ret8.base|) (bvadd |sll_circular_append_#t~ret8.offset| (_ bv4 32))) |sll_circular_append_#in~data|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:04,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {936#(and (= |sll_circular_append_#t~ret8.offset| (_ bv0 32)) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select (select |#memory_int| |sll_circular_append_#t~ret8.base|) (bvadd |sll_circular_append_#t~ret8.offset| (_ bv4 32))) |sll_circular_append_#in~data|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {940#(and (= |sll_circular_append_#in~data| (select (select |#memory_int| sll_circular_append_~new_last~0.base) (_ bv4 32))) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset) (= (_ bv0 32) sll_circular_append_~new_last~0.offset))} is VALID [2018-11-14 16:32:04,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {940#(and (= |sll_circular_append_#in~data| (select (select |#memory_int| sll_circular_append_~new_last~0.base) (_ bv4 32))) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset) (= (_ bv0 32) sll_circular_append_~new_last~0.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset, 4bv32);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {944#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (_ bv0 32)) (= |sll_circular_append_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv4 32))))} is VALID [2018-11-14 16:32:04,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {944#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (_ bv0 32)) (= |sll_circular_append_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv4 32))))} assume true; {944#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (_ bv0 32)) (= |sll_circular_append_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv4 32))))} is VALID [2018-11-14 16:32:04,245 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {944#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv0 32)) (_ bv0 32)) (= |sll_circular_append_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|)) (_ bv4 32))))} {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #131#return; {951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (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)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:32:04,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (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)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 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; {955#(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-14 16:32:04,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {955#(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); {959#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:32:04,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {959#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem18;havoc #t~mem18; {817#false} is VALID [2018-11-14 16:32:04,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-14 16:32:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:32:04,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:32:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:32:04,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 16:32:04,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-14 16:32:04,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:32:04,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:32:04,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:04,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:32:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:32:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:32:04,358 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 12 states. [2018-11-14 16:32:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:07,549 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-14 16:32:07,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:32:07,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-14 16:32:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:32:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:32:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-14 16:32:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:32:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-14 16:32:07,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2018-11-14 16:32:07,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:07,729 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:32:07,729 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:32:07,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:32:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:32:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-14 16:32:07,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:32:07,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2018-11-14 16:32:07,949 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2018-11-14 16:32:07,949 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2018-11-14 16:32:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:07,953 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 16:32:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 16:32:07,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:07,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:07,954 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2018-11-14 16:32:07,954 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2018-11-14 16:32:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:07,958 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 16:32:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 16:32:07,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:07,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:07,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:32:07,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:32:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:32:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-14 16:32:07,963 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 46 [2018-11-14 16:32:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:32:07,963 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-14 16:32:07,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:32:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 16:32:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:32:07,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:32:07,965 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] [2018-11-14 16:32:07,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:32:07,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:32:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -254401254, now seen corresponding path program 1 times [2018-11-14 16:32:07,966 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:32:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:32:07,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:32:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:08,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:32:08,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:32:08,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:08,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:08,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 16:32:08,229 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:10,410 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| sll_circular_create_~head~0.base)) (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~head~0.base (_ bv1 1))))) is different from true [2018-11-14 16:32:12,588 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:32:14,652 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:32:16,740 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:32:16,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:16,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:16,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-14 16:32:16,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-14 16:32:16,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:16,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:16,835 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-14 16:32:16,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-14 16:32:18,846 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:18,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:32:18,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:32:18,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:18,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:19,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:32:19,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-14 16:32:19,012 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:23,358 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-14 16:32:25,509 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-14 16:32:25,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {1235#true} call ULTIMATE.init(); {1235#true} is VALID [2018-11-14 16:32:25,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {1235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1235#true} is VALID [2018-11-14 16:32:25,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {1235#true} assume true; {1235#true} is VALID [2018-11-14 16:32:25,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1235#true} {1235#true} #139#return; {1235#true} is VALID [2018-11-14 16:32:25,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {1235#true} call #t~ret22 := main(); {1235#true} is VALID [2018-11-14 16:32:25,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {1235#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1255#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:32:25,841 INFO L256 TraceCheckUtils]: 6: Hoare triple {1255#(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); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:25,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {1259#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:25,858 INFO L256 TraceCheckUtils]: 8: Hoare triple {1259#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:25,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {1259#(= |#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; {1269#(and (= (_ 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-14 16:32:25,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {1269#(and (= (_ 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); {1269#(and (= (_ 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-14 16:32:25,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {1269#(and (= (_ 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; {1276#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {1276#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1276#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,866 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1276#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1259#(= |#valid| |old(#valid)|)} #135#return; {1283#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-14 16:32:25,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} ~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; {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-14 16:32:25,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} assume true; {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-14 16:32:25,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} assume !!~bvsgt32(~len, 1bv32); {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-14 16:32:25,870 INFO L256 TraceCheckUtils]: 17: Hoare triple {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:25,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {1259#(= |#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; {1300#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 16:32:25,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {1300#(and (not (= (_ bv0 32) 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); {1300#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 16:32:25,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {1300#(and (not (= (_ bv0 32) 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; {1307#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {1307#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1307#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,877 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1307#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {1287#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} #137#return; {1314#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))))))} is VALID [2018-11-14 16:32:25,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {1314#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))))))} ~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; {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-14 16:32:25,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume true; {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-14 16:32:25,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume !~bvsgt32(~len, 1bv32); {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-14 16:32:25,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {1318#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} 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; {1328#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-14 16:32:25,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {1328#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume true; {1328#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-14 16:32:25,893 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1328#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} {1255#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #129#return; {1335#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)))} is VALID [2018-11-14 16:32:25,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {1335#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {1339#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:32:25,896 INFO L256 TraceCheckUtils]: 30: Hoare triple {1339#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_append(~#s~0.base, ~#s~0.offset, ~data~0); {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:25,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:25,913 INFO L256 TraceCheckUtils]: 32: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:25,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |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; {1354#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 16:32:25,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {1354#(and (= |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); {1354#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 16:32:25,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {1354#(and (= |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; {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,956 INFO L273 TraceCheckUtils]: 36: Hoare triple {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:25,959 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} #127#return; {1368#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select |old(#valid)| |sll_circular_append_#t~ret8.base|) (_ bv0 1)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))))) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:25,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {1368#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select |old(#valid)| |sll_circular_append_#t~ret8.base|) (_ bv0 1)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))))) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1372#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) |sll_circular_append_#t~mem9.base|) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:25,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {1372#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) |sll_circular_append_#t~mem9.base|) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset, 4bv32);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:25,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} assume true; {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:25,969 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} {1339#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #131#return; {1236#false} is VALID [2018-11-14 16:32:25,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {1236#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; {1236#false} is VALID [2018-11-14 16:32:25,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {1236#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1236#false} is VALID [2018-11-14 16:32:25,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {1236#false} assume !(~data~0 != #t~mem18);havoc #t~mem18;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;#t~post20 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post20);havoc #t~post20; {1236#false} is VALID [2018-11-14 16:32:25,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {1236#false} call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1236#false} is VALID [2018-11-14 16:32:25,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {1236#false} assume !(~ptr~0.base != #t~mem17.base || ~ptr~0.offset != #t~mem17.offset);havoc #t~mem17.base, #t~mem17.offset; {1236#false} is VALID [2018-11-14 16:32:25,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {1236#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1236#false} is VALID [2018-11-14 16:32:25,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2018-11-14 16:32:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-14 16:32:25,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:32:26,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:32:26,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:32:26,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:32:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:26,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:32:26,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:32:26,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:26,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:26,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 16:32:26,869 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:28,208 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-14 16:32:32,346 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-14 16:32:36,805 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-14 16:32:36,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:36,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:36,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-14 16:32:36,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-11-14 16:32:36,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:37,021 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-14 16:32:37,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-11-14 16:32:37,031 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:37,258 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-14 16:32:37,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:32:37,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:37,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:37,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:32:37,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:49 [2018-11-14 16:32:37,320 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:37,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {1235#true} call ULTIMATE.init(); {1235#true} is VALID [2018-11-14 16:32:37,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {1235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1235#true} is VALID [2018-11-14 16:32:37,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {1235#true} assume true; {1235#true} is VALID [2018-11-14 16:32:37,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1235#true} {1235#true} #139#return; {1235#true} is VALID [2018-11-14 16:32:37,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {1235#true} call #t~ret22 := main(); {1235#true} is VALID [2018-11-14 16:32:37,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {1235#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1444#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-14 16:32:37,773 INFO L256 TraceCheckUtils]: 6: Hoare triple {1444#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:37,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {1259#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:37,774 INFO L256 TraceCheckUtils]: 8: Hoare triple {1259#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:37,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {1259#(= |#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; {1457#(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-14 16:32:37,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {1457#(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); {1457#(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-14 16:32:37,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {1457#(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; {1457#(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-14 16:32:37,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {1457#(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; {1457#(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-14 16:32:37,782 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1457#(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)))))} {1259#(= |#valid| |old(#valid)|)} #135#return; {1457#(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-14 16:32:37,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {1457#(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)))))} ~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; {1457#(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-14 16:32:37,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {1457#(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; {1457#(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-14 16:32:37,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {1457#(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 !!~bvsgt32(~len, 1bv32); {1457#(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-14 16:32:37,785 INFO L256 TraceCheckUtils]: 17: Hoare triple {1457#(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 #t~ret4.base, #t~ret4.offset := node_create(~data); {1259#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:32:37,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {1259#(= |#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; {1485#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 16:32:37,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {1485#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) 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); {1485#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 16:32:37,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {1485#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) 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; {1492#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 16:32:37,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {1492#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1492#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 16:32:37,792 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1492#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} {1457#(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)))))} #137#return; {1499#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (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|)))))} is VALID [2018-11-14 16:32:37,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {1499#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (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|)))))} ~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; {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 16:32:37,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 32))))} assume true; {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 16:32:37,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 32))))} assume !~bvsgt32(~len, 1bv32); {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 16:32:37,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {1503#(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_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_circular_create_~head~0.base)))) (not (= sll_circular_create_~head~0.base (_ bv0 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; {1513#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (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|)))))} is VALID [2018-11-14 16:32:37,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {1513#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (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|)))))} assume true; {1513#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (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|)))))} is VALID [2018-11-14 16:32:37,808 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1513#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (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|)))))} {1444#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #129#return; {1520#(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|)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= (_ 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))))} is VALID [2018-11-14 16:32:37,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {1520#(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|)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= (_ 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))))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {1524#(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| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (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|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:32:37,811 INFO L256 TraceCheckUtils]: 30: Hoare triple {1524#(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| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (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|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_append(~#s~0.base, ~#s~0.offset, ~data~0); {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:37,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:37,819 INFO L256 TraceCheckUtils]: 32: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1343#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:37,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |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; {1354#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 16:32:37,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {1354#(and (= |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); {1354#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 16:32:37,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {1354#(and (= |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; {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:37,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-14 16:32:37,826 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1361#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (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|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1347#(and (= |#valid| |old(#valid)|) (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} #127#return; {1368#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select |old(#valid)| |sll_circular_append_#t~ret8.base|) (_ bv0 1)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))))) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} is VALID [2018-11-14 16:32:37,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {1368#(and (= |sll_circular_append_#in~head.base| sll_circular_append_~head.base) (= (select |old(#valid)| |sll_circular_append_#t~ret8.base|) (_ bv0 1)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_append_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))))) (= |sll_circular_append_#in~head.offset| sll_circular_append_~head.offset))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1372#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) |sll_circular_append_#t~mem9.base|) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:37,833 INFO L273 TraceCheckUtils]: 39: Hoare triple {1372#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) |sll_circular_append_#t~mem9.base|) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset, 4bv32);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:37,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} assume true; {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} is VALID [2018-11-14 16:32:37,837 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1376#(exists ((sll_circular_append_~new_last~0.base (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base (store (select |old(#memory_$Pointer$.base)| sll_circular_append_~new_last~0.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_append_#in~head.base|) |sll_circular_append_#in~head.offset|) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_circular_append_~new_last~0.base))))} {1524#(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| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (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|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #131#return; {1236#false} is VALID [2018-11-14 16:32:37,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {1236#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; {1236#false} is VALID [2018-11-14 16:32:37,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {1236#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1236#false} is VALID [2018-11-14 16:32:37,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {1236#false} assume !(~data~0 != #t~mem18);havoc #t~mem18;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;#t~post20 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post20);havoc #t~post20; {1236#false} is VALID [2018-11-14 16:32:37,839 INFO L273 TraceCheckUtils]: 45: Hoare triple {1236#false} call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1236#false} is VALID [2018-11-14 16:32:37,839 INFO L273 TraceCheckUtils]: 46: Hoare triple {1236#false} assume !(~ptr~0.base != #t~mem17.base || ~ptr~0.offset != #t~mem17.offset);havoc #t~mem17.base, #t~mem17.offset; {1236#false} is VALID [2018-11-14 16:32:37,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {1236#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1236#false} is VALID [2018-11-14 16:32:37,839 INFO L273 TraceCheckUtils]: 48: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2018-11-14 16:32:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2018-11-14 16:32:37,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:32:38,211 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-14 16:32:38,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:32:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 31 [2018-11-14 16:32:38,490 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-11-14 16:32:38,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:32:38,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:32:38,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:38,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:32:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:32:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=5, NotChecked=114, Total=992 [2018-11-14 16:32:38,651 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 31 states. [2018-11-14 16:33:02,411 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-11-14 16:33:07,956 WARN L854 $PredicateComparison]: unable to prove that (and (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))))) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| sll_circular_create_~head~0.base)) (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))) is different from true