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/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:07:46,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:07:46,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:07:46,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:07:46,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:07:46,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:07:46,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:07:46,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:07:46,555 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:07:46,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:07:46,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:07:46,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:07:46,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:07:46,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:07:46,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:07:46,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:07:46,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:07:46,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:07:46,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:07:46,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:07:46,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:07:46,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:07:46,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:07:46,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:07:46,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:07:46,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:07:46,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:07:46,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:07:46,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:07:46,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:07:46,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:07:46,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:07:46,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:07:46,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:07:46,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:07:46,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:07:46,582 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:07:46,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:07:46,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:07:46,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:07:46,613 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:07:46,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:07:46,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:07:46,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:07:46,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:07:46,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:07:46,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:07:46,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:07:46,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:07:46,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:07:46,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:07:46,620 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:07:46,620 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:07:46,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:07:46,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:07:46,620 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:07:46,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:07:46,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:07:46,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:07:46,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:07:46,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:07:46,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:07:46,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:07:46,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:07:46,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:07:46,624 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:07:46,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:07:46,625 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:07:46,625 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:07:46,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:07:46,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:07:46,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:07:46,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:07:46,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:07:46,697 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:07:46,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:07:46,766 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd08127/bde5b2f0e4b54baba74be190608830a0/FLAGa5c148356 [2018-11-18 22:07:47,367 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:07:47,368 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:07:47,382 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd08127/bde5b2f0e4b54baba74be190608830a0/FLAGa5c148356 [2018-11-18 22:07:47,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd08127/bde5b2f0e4b54baba74be190608830a0 [2018-11-18 22:07:47,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:07:47,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:07:47,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:07:47,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:07:47,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:07:47,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:07:47" (1/1) ... [2018-11-18 22:07:47,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6ca666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:47, skipping insertion in model container [2018-11-18 22:07:47,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:07:47" (1/1) ... [2018-11-18 22:07:47,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:07:47,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:07:48,143 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:07:48,161 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:07:48,245 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:07:48,405 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:07:48,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48 WrapperNode [2018-11-18 22:07:48,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:07:48,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:07:48,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:07:48,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:07:48,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... [2018-11-18 22:07:48,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:07:48,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:07:48,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:07:48,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:07:48,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:07:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-18 22:07:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:07:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:07:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:07:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:07:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:07:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:07:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:07:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:07:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:07:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:07:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:07:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:07:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:07:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:07:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:07:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:07:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:07:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:07:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:07:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:07:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:07:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:07:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:07:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:07:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:07:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:07:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:07:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:07:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 22:07:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:07:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:07:49,743 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:07:49,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:07:49 BoogieIcfgContainer [2018-11-18 22:07:49,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:07:49,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:07:49,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:07:49,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:07:49,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:07:47" (1/3) ... [2018-11-18 22:07:49,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f55815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:07:49, skipping insertion in model container [2018-11-18 22:07:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:48" (2/3) ... [2018-11-18 22:07:49,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f55815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:07:49, skipping insertion in model container [2018-11-18 22:07:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:07:49" (3/3) ... [2018-11-18 22:07:49,752 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:07:49,761 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:07:49,770 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:07:49,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:07:49,823 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:07:49,823 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:07:49,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:07:49,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:07:49,824 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:07:49,824 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:07:49,824 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:07:49,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:07:49,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:07:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-18 22:07:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:07:49,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:49,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:49,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:49,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -146834168, now seen corresponding path program 1 times [2018-11-18 22:07:49,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:49,865 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:07:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:49,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:50,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-18 22:07:50,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {63#true} is VALID [2018-11-18 22:07:50,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-18 22:07:50,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #146#return; {63#true} is VALID [2018-11-18 22:07:50,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret15 := main(); {63#true} is VALID [2018-11-18 22:07:50,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} ~len~0 := 2bv32;~data~0 := 1bv32; {63#true} is VALID [2018-11-18 22:07:50,251 INFO L256 TraceCheckUtils]: 6: Hoare triple {63#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {63#true} is VALID [2018-11-18 22:07:50,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {63#true} is VALID [2018-11-18 22:07:50,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-18 22:07:50,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {64#false} is VALID [2018-11-18 22:07:50,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-18 22:07:50,269 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {64#false} {63#true} #138#return; {64#false} is VALID [2018-11-18 22:07:50,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {64#false} is VALID [2018-11-18 22:07:50,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-18 22:07:50,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {64#false} ~i~0 := 0bv32; {64#false} is VALID [2018-11-18 22:07:50,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-18 22:07:50,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {64#false} is VALID [2018-11-18 22:07:50,271 INFO L256 TraceCheckUtils]: 17: Hoare triple {64#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {64#false} is VALID [2018-11-18 22:07:50,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {64#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {64#false} is VALID [2018-11-18 22:07:50,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-18 22:07:50,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {64#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {64#false} is VALID [2018-11-18 22:07:50,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-18 22:07:50,273 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {64#false} {64#false} #142#return; {64#false} is VALID [2018-11-18 22:07:50,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {64#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {64#false} is VALID [2018-11-18 22:07:50,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-18 22:07:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:07:50,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:07:50,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:07:50,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:07:50,302 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 22:07:50,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:50,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:07:50,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:50,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:07:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:07:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:07:50,689 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-18 22:07:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:51,102 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-18 22:07:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:07:51,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 22:07:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:07:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:07:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-18 22:07:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:07:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-18 22:07:51,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 124 transitions. [2018-11-18 22:07:51,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:51,527 INFO L225 Difference]: With dead ends: 99 [2018-11-18 22:07:51,527 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 22:07:51,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:07:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 22:07:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-18 22:07:51,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:07:51,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-18 22:07:51,605 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-18 22:07:51,605 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-18 22:07:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:51,611 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-18 22:07:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-18 22:07:51,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:51,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:51,613 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-18 22:07:51,613 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-18 22:07:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:51,618 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-18 22:07:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-18 22:07:51,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:51,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:51,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:07:51,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:07:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:07:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-18 22:07:51,625 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 25 [2018-11-18 22:07:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:07:51,626 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-18 22:07:51,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:07:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-18 22:07:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:07:51,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:51,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:51,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:51,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1395214345, now seen corresponding path program 1 times [2018-11-18 22:07:51,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:07:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:51,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:51,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-18 22:07:51,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {429#true} is VALID [2018-11-18 22:07:51,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-18 22:07:51,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #146#return; {429#true} is VALID [2018-11-18 22:07:51,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret15 := main(); {429#true} is VALID [2018-11-18 22:07:51,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} ~len~0 := 2bv32;~data~0 := 1bv32; {449#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:51,965 INFO L256 TraceCheckUtils]: 6: Hoare triple {449#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {429#true} is VALID [2018-11-18 22:07:51,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {429#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {456#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:51,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#(= |sll_create_#in~len| sll_create_~len)} assume true; {456#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:51,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {456#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:07:51,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:07:51,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:07:51,996 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {463#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {449#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {430#false} is VALID [2018-11-18 22:07:51,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {430#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {430#false} is VALID [2018-11-18 22:07:51,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {430#false} assume true; {430#false} is VALID [2018-11-18 22:07:51,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {430#false} assume !~bvslt32(~i~0, ~len~0); {430#false} is VALID [2018-11-18 22:07:51,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {430#false} ~i~0 := 0bv32; {430#false} is VALID [2018-11-18 22:07:51,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume true; {430#false} is VALID [2018-11-18 22:07:51,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {430#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {430#false} is VALID [2018-11-18 22:07:51,999 INFO L256 TraceCheckUtils]: 19: Hoare triple {430#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {430#false} is VALID [2018-11-18 22:07:51,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {430#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {430#false} is VALID [2018-11-18 22:07:51,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {430#false} assume true; {430#false} is VALID [2018-11-18 22:07:52,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {430#false} assume !~bvsgt32(~index, 0bv32); {430#false} is VALID [2018-11-18 22:07:52,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {430#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {430#false} is VALID [2018-11-18 22:07:52,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {430#false} assume true; {430#false} is VALID [2018-11-18 22:07:52,001 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {430#false} {430#false} #142#return; {430#false} is VALID [2018-11-18 22:07:52,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {430#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {430#false} is VALID [2018-11-18 22:07:52,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-18 22:07:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:07:52,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:07:52,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:07:52,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:07:52,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 22:07:52,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:52,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:07:52,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:52,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:07:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:07:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:07:52,071 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-11-18 22:07:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:52,689 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-18 22:07:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:07:52,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 22:07:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:07:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:07:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-18 22:07:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:07:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-18 22:07:52,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2018-11-18 22:07:52,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:52,913 INFO L225 Difference]: With dead ends: 79 [2018-11-18 22:07:52,913 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:07:52,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:07:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:07:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-18 22:07:52,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:07:52,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2018-11-18 22:07:52,949 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2018-11-18 22:07:52,949 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2018-11-18 22:07:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:52,954 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-18 22:07:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-18 22:07:52,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:52,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:52,955 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2018-11-18 22:07:52,956 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2018-11-18 22:07:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:52,959 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-18 22:07:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-18 22:07:52,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:52,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:52,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:07:52,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:07:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:07:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-18 22:07:52,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 28 [2018-11-18 22:07:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:07:52,964 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-18 22:07:52,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:07:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-18 22:07:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:07:52,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:52,966 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:52,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:52,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -95862248, now seen corresponding path program 1 times [2018-11-18 22:07:52,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:52,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:52,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:07:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:53,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:53,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-18 22:07:53,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-18 22:07:53,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #146#return; {796#true} is VALID [2018-11-18 22:07:53,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret15 := main(); {796#true} is VALID [2018-11-18 22:07:53,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} ~len~0 := 2bv32;~data~0 := 1bv32; {816#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:53,225 INFO L256 TraceCheckUtils]: 6: Hoare triple {816#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {796#true} is VALID [2018-11-18 22:07:53,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {823#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:53,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(= |sll_create_#in~len| sll_create_~len)} assume true; {823#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:53,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {823#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {823#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:53,231 INFO L256 TraceCheckUtils]: 10: Hoare triple {823#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {796#true} is VALID [2018-11-18 22:07:53,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {796#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; {796#true} is VALID [2018-11-18 22:07:53,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {796#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {796#true} is VALID [2018-11-18 22:07:53,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {796#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {796#true} is VALID [2018-11-18 22:07:53,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,237 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {796#true} {823#(= |sll_create_#in~len| sll_create_~len)} #134#return; {823#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:53,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#(= |sll_create_#in~len| sll_create_~len)} ~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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {823#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:07:53,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {823#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {854#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-18 22:07:53,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {854#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-18 22:07:53,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,251 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {816#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {797#false} is VALID [2018-11-18 22:07:53,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {797#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {797#false} is VALID [2018-11-18 22:07:53,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {797#false} assume !~bvslt32(~i~0, ~len~0); {797#false} is VALID [2018-11-18 22:07:53,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {797#false} ~i~0 := 0bv32; {797#false} is VALID [2018-11-18 22:07:53,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {797#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {797#false} is VALID [2018-11-18 22:07:53,254 INFO L256 TraceCheckUtils]: 29: Hoare triple {797#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {797#false} is VALID [2018-11-18 22:07:53,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {797#false} is VALID [2018-11-18 22:07:53,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {797#false} assume !~bvsgt32(~index, 0bv32); {797#false} is VALID [2018-11-18 22:07:53,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {797#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {797#false} is VALID [2018-11-18 22:07:53,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,256 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {797#false} {797#false} #142#return; {797#false} is VALID [2018-11-18 22:07:53,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {797#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {797#false} is VALID [2018-11-18 22:07:53,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-18 22:07:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:07:53,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:07:53,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-18 22:07:53,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {797#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {797#false} is VALID [2018-11-18 22:07:53,664 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {796#true} {797#false} #142#return; {797#false} is VALID [2018-11-18 22:07:53,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {796#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {796#true} is VALID [2018-11-18 22:07:53,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {796#true} assume !~bvsgt32(~index, 0bv32); {796#true} is VALID [2018-11-18 22:07:53,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {796#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {796#true} is VALID [2018-11-18 22:07:53,666 INFO L256 TraceCheckUtils]: 29: Hoare triple {797#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {796#true} is VALID [2018-11-18 22:07:53,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {797#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {797#false} is VALID [2018-11-18 22:07:53,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {797#false} ~i~0 := 0bv32; {797#false} is VALID [2018-11-18 22:07:53,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {797#false} assume !~bvslt32(~i~0, ~len~0); {797#false} is VALID [2018-11-18 22:07:53,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-18 22:07:53,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {797#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {797#false} is VALID [2018-11-18 22:07:53,671 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {961#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #138#return; {797#false} is VALID [2018-11-18 22:07:53,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {974#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {861#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {974#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {974#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-18 22:07:53,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {974#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-18 22:07:53,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,682 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {796#true} {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #134#return; {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {796#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {796#true} is VALID [2018-11-18 22:07:53,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {796#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {796#true} is VALID [2018-11-18 22:07:53,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {796#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; {796#true} is VALID [2018-11-18 22:07:53,684 INFO L256 TraceCheckUtils]: 10: Hoare triple {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {796#true} is VALID [2018-11-18 22:07:53,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {981#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:53,703 INFO L256 TraceCheckUtils]: 6: Hoare triple {961#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {796#true} is VALID [2018-11-18 22:07:53,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} ~len~0 := 2bv32;~data~0 := 1bv32; {961#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:53,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret15 := main(); {796#true} is VALID [2018-11-18 22:07:53,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #146#return; {796#true} is VALID [2018-11-18 22:07:53,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-18 22:07:53,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-18 22:07:53,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-18 22:07:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:07:53,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:07:53,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:07:53,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:07:53,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:53,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:07:53,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:53,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:07:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:07:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:07:53,842 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-11-18 22:07:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:55,090 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-18 22:07:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:07:55,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:07:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:07:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:07:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-18 22:07:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:07:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-18 22:07:55,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-18 22:07:55,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:55,325 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:07:55,326 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 22:07:55,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:07:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 22:07:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-18 22:07:55,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:07:55,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 53 states. [2018-11-18 22:07:55,374 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 53 states. [2018-11-18 22:07:55,374 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 53 states. [2018-11-18 22:07:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:55,377 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-18 22:07:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-18 22:07:55,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:55,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:55,379 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 56 states. [2018-11-18 22:07:55,379 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 56 states. [2018-11-18 22:07:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:55,382 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-18 22:07:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-18 22:07:55,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:55,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:55,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:07:55,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:07:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:07:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-18 22:07:55,387 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 38 [2018-11-18 22:07:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:07:55,387 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-18 22:07:55,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:07:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-18 22:07:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 22:07:55,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:55,390 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:55,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:55,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:55,390 INFO L82 PathProgramCache]: Analyzing trace with hash 454186745, now seen corresponding path program 2 times [2018-11-18 22:07:55,391 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:55,391 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:55,420 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:07:55,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:07:55,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:07:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:55,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:55,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1337#true} is VALID [2018-11-18 22:07:55,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1337#true} is VALID [2018-11-18 22:07:55,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #146#return; {1337#true} is VALID [2018-11-18 22:07:55,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {1337#true} call #t~ret15 := main(); {1337#true} is VALID [2018-11-18 22:07:55,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1337#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1357#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:55,678 INFO L256 TraceCheckUtils]: 6: Hoare triple {1357#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1337#true} is VALID [2018-11-18 22:07:55,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {1337#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1337#true} is VALID [2018-11-18 22:07:55,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {1337#true} assume !!~bvsgt32(~len, 0bv32); {1337#true} is VALID [2018-11-18 22:07:55,679 INFO L256 TraceCheckUtils]: 10: Hoare triple {1337#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1337#true} is VALID [2018-11-18 22:07:55,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {1337#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; {1337#true} is VALID [2018-11-18 22:07:55,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1337#true} is VALID [2018-11-18 22:07:55,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {1337#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1337#true} is VALID [2018-11-18 22:07:55,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,680 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1337#true} {1337#true} #134#return; {1337#true} is VALID [2018-11-18 22:07:55,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {1337#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1337#true} is VALID [2018-11-18 22:07:55,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {1337#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1337#true} is VALID [2018-11-18 22:07:55,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {1337#true} assume !!~bvsgt32(~len, 0bv32); {1337#true} is VALID [2018-11-18 22:07:55,681 INFO L256 TraceCheckUtils]: 20: Hoare triple {1337#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1337#true} is VALID [2018-11-18 22:07:55,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {1337#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; {1337#true} is VALID [2018-11-18 22:07:55,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {1337#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1337#true} is VALID [2018-11-18 22:07:55,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {1337#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1337#true} is VALID [2018-11-18 22:07:55,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,682 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1337#true} {1337#true} #134#return; {1337#true} is VALID [2018-11-18 22:07:55,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {1337#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1337#true} is VALID [2018-11-18 22:07:55,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {1337#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1337#true} is VALID [2018-11-18 22:07:55,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {1337#true} assume !~bvsgt32(~len, 0bv32); {1337#true} is VALID [2018-11-18 22:07:55,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {1337#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1337#true} is VALID [2018-11-18 22:07:55,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-18 22:07:55,685 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1337#true} {1357#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {1357#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:55,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {1357#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1442#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:55,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {1442#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1442#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:55,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {1442#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1338#false} is VALID [2018-11-18 22:07:55,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {1338#false} ~i~0 := 0bv32; {1338#false} is VALID [2018-11-18 22:07:55,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {1338#false} assume true; {1338#false} is VALID [2018-11-18 22:07:55,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {1338#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1338#false} is VALID [2018-11-18 22:07:55,688 INFO L256 TraceCheckUtils]: 39: Hoare triple {1338#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1338#false} is VALID [2018-11-18 22:07:55,688 INFO L273 TraceCheckUtils]: 40: Hoare triple {1338#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1338#false} is VALID [2018-11-18 22:07:55,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {1338#false} assume true; {1338#false} is VALID [2018-11-18 22:07:55,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {1338#false} assume !~bvsgt32(~index, 0bv32); {1338#false} is VALID [2018-11-18 22:07:55,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {1338#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1338#false} is VALID [2018-11-18 22:07:55,690 INFO L273 TraceCheckUtils]: 44: Hoare triple {1338#false} assume true; {1338#false} is VALID [2018-11-18 22:07:55,690 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1338#false} {1338#false} #142#return; {1338#false} is VALID [2018-11-18 22:07:55,690 INFO L273 TraceCheckUtils]: 46: Hoare triple {1338#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1338#false} is VALID [2018-11-18 22:07:55,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2018-11-18 22:07:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:07:55,695 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:07:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:07:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:07:55,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-18 22:07:55,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:55,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:07:55,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:55,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:07:55,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:07:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:07:55,773 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-11-18 22:07:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:56,110 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-18 22:07:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:07:56,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-18 22:07:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:07:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:07:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-18 22:07:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:07:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-18 22:07:56,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-18 22:07:56,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:56,222 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:07:56,222 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 22:07:56,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:07:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 22:07:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-18 22:07:56,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:07:56,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 55 states. [2018-11-18 22:07:56,307 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 55 states. [2018-11-18 22:07:56,307 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 55 states. [2018-11-18 22:07:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:56,312 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-18 22:07:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-18 22:07:56,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:56,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:56,314 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 64 states. [2018-11-18 22:07:56,314 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 64 states. [2018-11-18 22:07:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:56,318 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-18 22:07:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-18 22:07:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:56,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:56,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:07:56,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:07:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 22:07:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-18 22:07:56,322 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 48 [2018-11-18 22:07:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:07:56,323 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-18 22:07:56,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:07:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-18 22:07:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 22:07:56,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:56,325 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:56,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:56,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1505666798, now seen corresponding path program 1 times [2018-11-18 22:07:56,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:56,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:07:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:56,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:56,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {1798#true} call ULTIMATE.init(); {1798#true} is VALID [2018-11-18 22:07:56,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {1798#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1798#true} is VALID [2018-11-18 22:07:56,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1798#true} {1798#true} #146#return; {1798#true} is VALID [2018-11-18 22:07:56,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {1798#true} call #t~ret15 := main(); {1798#true} is VALID [2018-11-18 22:07:56,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {1798#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1818#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:56,687 INFO L256 TraceCheckUtils]: 6: Hoare triple {1818#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1798#true} is VALID [2018-11-18 22:07:56,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {1798#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1798#true} is VALID [2018-11-18 22:07:56,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {1798#true} assume !!~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:56,688 INFO L256 TraceCheckUtils]: 10: Hoare triple {1798#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1798#true} is VALID [2018-11-18 22:07:56,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {1798#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; {1798#true} is VALID [2018-11-18 22:07:56,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {1798#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1798#true} is VALID [2018-11-18 22:07:56,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {1798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1798#true} is VALID [2018-11-18 22:07:56,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,690 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1798#true} {1798#true} #134#return; {1798#true} is VALID [2018-11-18 22:07:56,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {1798#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1798#true} is VALID [2018-11-18 22:07:56,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {1798#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1798#true} is VALID [2018-11-18 22:07:56,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {1798#true} assume !!~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:56,691 INFO L256 TraceCheckUtils]: 20: Hoare triple {1798#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1798#true} is VALID [2018-11-18 22:07:56,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {1798#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; {1798#true} is VALID [2018-11-18 22:07:56,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {1798#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1798#true} is VALID [2018-11-18 22:07:56,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {1798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1798#true} is VALID [2018-11-18 22:07:56,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,692 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1798#true} {1798#true} #134#return; {1798#true} is VALID [2018-11-18 22:07:56,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {1798#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1798#true} is VALID [2018-11-18 22:07:56,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {1798#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1798#true} is VALID [2018-11-18 22:07:56,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {1798#true} assume !~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:56,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {1798#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1798#true} is VALID [2018-11-18 22:07:56,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,712 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1798#true} {1818#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {1818#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:56,724 INFO L273 TraceCheckUtils]: 33: Hoare triple {1818#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,747 INFO L256 TraceCheckUtils]: 36: Hoare triple {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1798#true} is VALID [2018-11-18 22:07:56,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {1798#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1798#true} is VALID [2018-11-18 22:07:56,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {1798#true} assume !~bvsgt32(~index, 0bv32); {1798#true} is VALID [2018-11-18 22:07:56,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {1798#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1798#true} is VALID [2018-11-18 22:07:56,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,753 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1798#true} {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #140#return; {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {1903#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1934#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {1934#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1934#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:07:56,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {1934#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1799#false} is VALID [2018-11-18 22:07:56,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {1799#false} ~i~0 := 0bv32; {1799#false} is VALID [2018-11-18 22:07:56,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {1799#false} assume true; {1799#false} is VALID [2018-11-18 22:07:56,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {1799#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1799#false} is VALID [2018-11-18 22:07:56,756 INFO L256 TraceCheckUtils]: 49: Hoare triple {1799#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1799#false} is VALID [2018-11-18 22:07:56,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {1799#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1799#false} is VALID [2018-11-18 22:07:56,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {1799#false} assume true; {1799#false} is VALID [2018-11-18 22:07:56,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {1799#false} assume !~bvsgt32(~index, 0bv32); {1799#false} is VALID [2018-11-18 22:07:56,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {1799#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1799#false} is VALID [2018-11-18 22:07:56,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {1799#false} assume true; {1799#false} is VALID [2018-11-18 22:07:56,758 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1799#false} {1799#false} #142#return; {1799#false} is VALID [2018-11-18 22:07:56,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {1799#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1799#false} is VALID [2018-11-18 22:07:56,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2018-11-18 22:07:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:07:56,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:07:56,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2018-11-18 22:07:56,996 INFO L273 TraceCheckUtils]: 56: Hoare triple {1799#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1799#false} is VALID [2018-11-18 22:07:56,996 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1798#true} {1799#false} #142#return; {1799#false} is VALID [2018-11-18 22:07:56,996 INFO L273 TraceCheckUtils]: 54: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {1798#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1798#true} is VALID [2018-11-18 22:07:56,997 INFO L273 TraceCheckUtils]: 52: Hoare triple {1798#true} assume !~bvsgt32(~index, 0bv32); {1798#true} is VALID [2018-11-18 22:07:56,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:56,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {1798#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1798#true} is VALID [2018-11-18 22:07:56,998 INFO L256 TraceCheckUtils]: 49: Hoare triple {1799#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1798#true} is VALID [2018-11-18 22:07:56,998 INFO L273 TraceCheckUtils]: 48: Hoare triple {1799#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1799#false} is VALID [2018-11-18 22:07:56,999 INFO L273 TraceCheckUtils]: 47: Hoare triple {1799#false} assume true; {1799#false} is VALID [2018-11-18 22:07:56,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {1799#false} ~i~0 := 0bv32; {1799#false} is VALID [2018-11-18 22:07:56,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {2013#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {1799#false} is VALID [2018-11-18 22:07:57,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {2013#(bvslt main_~i~0 main_~len~0)} assume true; {2013#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 22:07:57,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2013#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 22:07:57,003 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1798#true} {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #140#return; {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:07:57,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,004 INFO L273 TraceCheckUtils]: 40: Hoare triple {1798#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1798#true} is VALID [2018-11-18 22:07:57,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {1798#true} assume !~bvsgt32(~index, 0bv32); {1798#true} is VALID [2018-11-18 22:07:57,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {1798#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1798#true} is VALID [2018-11-18 22:07:57,006 INFO L256 TraceCheckUtils]: 36: Hoare triple {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1798#true} is VALID [2018-11-18 22:07:57,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:07:57,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume true; {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:07:57,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {2051#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2020#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:07:57,010 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1798#true} {2051#(bvslt (_ bv1 32) main_~len~0)} #138#return; {2051#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 22:07:57,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {1798#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1798#true} is VALID [2018-11-18 22:07:57,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {1798#true} assume !~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:57,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {1798#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1798#true} is VALID [2018-11-18 22:07:57,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {1798#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1798#true} is VALID [2018-11-18 22:07:57,012 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1798#true} {1798#true} #134#return; {1798#true} is VALID [2018-11-18 22:07:57,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {1798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {1798#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {1798#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; {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L256 TraceCheckUtils]: 20: Hoare triple {1798#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {1798#true} assume !!~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {1798#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1798#true} is VALID [2018-11-18 22:07:57,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {1798#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1798#true} is VALID [2018-11-18 22:07:57,014 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1798#true} {1798#true} #134#return; {1798#true} is VALID [2018-11-18 22:07:57,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {1798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1798#true} is VALID [2018-11-18 22:07:57,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {1798#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1798#true} is VALID [2018-11-18 22:07:57,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {1798#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; {1798#true} is VALID [2018-11-18 22:07:57,015 INFO L256 TraceCheckUtils]: 10: Hoare triple {1798#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1798#true} is VALID [2018-11-18 22:07:57,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {1798#true} assume !!~bvsgt32(~len, 0bv32); {1798#true} is VALID [2018-11-18 22:07:57,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {1798#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1798#true} is VALID [2018-11-18 22:07:57,016 INFO L256 TraceCheckUtils]: 6: Hoare triple {2051#(bvslt (_ bv1 32) main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1798#true} is VALID [2018-11-18 22:07:57,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {1798#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2051#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 22:07:57,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {1798#true} call #t~ret15 := main(); {1798#true} is VALID [2018-11-18 22:07:57,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1798#true} {1798#true} #146#return; {1798#true} is VALID [2018-11-18 22:07:57,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {1798#true} assume true; {1798#true} is VALID [2018-11-18 22:07:57,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {1798#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1798#true} is VALID [2018-11-18 22:07:57,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {1798#true} call ULTIMATE.init(); {1798#true} is VALID [2018-11-18 22:07:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:07:57,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:07:57,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 22:07:57,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-18 22:07:57,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:57,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:07:57,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:57,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:07:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:07:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:07:57,151 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-11-18 22:07:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:58,263 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-11-18 22:07:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:07:58,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-18 22:07:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:07:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:07:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-18 22:07:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:07:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-18 22:07:58,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2018-11-18 22:07:58,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:58,486 INFO L225 Difference]: With dead ends: 89 [2018-11-18 22:07:58,486 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:07:58,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:07:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:07:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2018-11-18 22:07:58,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:07:58,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 59 states. [2018-11-18 22:07:58,555 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 59 states. [2018-11-18 22:07:58,555 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 59 states. [2018-11-18 22:07:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:58,559 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 22:07:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-11-18 22:07:58,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:58,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:58,560 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 75 states. [2018-11-18 22:07:58,560 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 75 states. [2018-11-18 22:07:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:07:58,564 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 22:07:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-11-18 22:07:58,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:07:58,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:07:58,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:07:58,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:07:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:07:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-18 22:07:58,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 58 [2018-11-18 22:07:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:07:58,569 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-18 22:07:58,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:07:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-18 22:07:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 22:07:58,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:07:58,572 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:07:58,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:07:58,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:07:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1131628707, now seen corresponding path program 2 times [2018-11-18 22:07:58,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:07:58,573 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:07:58,595 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:07:58,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:07:58,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:07:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:07:58,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:58,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2513#true} is VALID [2018-11-18 22:07:58,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {2513#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2513#true} is VALID [2018-11-18 22:07:58,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #146#return; {2513#true} is VALID [2018-11-18 22:07:58,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret15 := main(); {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {2513#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L256 TraceCheckUtils]: 6: Hoare triple {2513#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {2513#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#true} assume !!~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:58,875 INFO L256 TraceCheckUtils]: 10: Hoare triple {2513#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {2513#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; {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {2513#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {2513#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2513#true} {2513#true} #134#return; {2513#true} is VALID [2018-11-18 22:07:58,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {2513#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2513#true} is VALID [2018-11-18 22:07:58,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {2513#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2513#true} is VALID [2018-11-18 22:07:58,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {2513#true} assume !!~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:58,877 INFO L256 TraceCheckUtils]: 20: Hoare triple {2513#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2513#true} is VALID [2018-11-18 22:07:58,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {2513#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; {2513#true} is VALID [2018-11-18 22:07:58,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {2513#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2513#true} is VALID [2018-11-18 22:07:58,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {2513#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2513#true} is VALID [2018-11-18 22:07:58,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,878 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2513#true} {2513#true} #134#return; {2513#true} is VALID [2018-11-18 22:07:58,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {2513#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2513#true} is VALID [2018-11-18 22:07:58,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {2513#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2513#true} is VALID [2018-11-18 22:07:58,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {2513#true} assume !~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:58,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {2513#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2513#true} is VALID [2018-11-18 22:07:58,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,880 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2513#true} {2513#true} #138#return; {2513#true} is VALID [2018-11-18 22:07:58,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {2513#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2617#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:58,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {2617#(= main_~i~0 (_ bv0 32))} assume true; {2617#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:58,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {2617#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2617#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:58,881 INFO L256 TraceCheckUtils]: 36: Hoare triple {2617#(= main_~i~0 (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2513#true} is VALID [2018-11-18 22:07:58,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {2513#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2513#true} is VALID [2018-11-18 22:07:58,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {2513#true} assume !~bvsgt32(~index, 0bv32); {2513#true} is VALID [2018-11-18 22:07:58,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {2513#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2513#true} is VALID [2018-11-18 22:07:58,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:58,884 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2513#true} {2617#(= main_~i~0 (_ bv0 32))} #140#return; {2617#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:58,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {2617#(= main_~i~0 (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:58,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:58,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:58,886 INFO L256 TraceCheckUtils]: 46: Hoare triple {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2513#true} is VALID [2018-11-18 22:07:58,887 INFO L273 TraceCheckUtils]: 47: Hoare triple {2513#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2661#(= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-18 22:07:58,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {2661#(= |sll_update_at_#in~index| sll_update_at_~index)} assume true; {2661#(= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-18 22:07:58,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {2661#(= |sll_update_at_#in~index| sll_update_at_~index)} assume !~bvsgt32(~index, 0bv32); {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:58,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:58,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} assume true; {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:58,891 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} {2648#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #140#return; {2514#false} is VALID [2018-11-18 22:07:58,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {2514#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2514#false} is VALID [2018-11-18 22:07:58,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:58,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {2514#false} assume !~bvslt32(~i~0, ~len~0); {2514#false} is VALID [2018-11-18 22:07:58,892 INFO L273 TraceCheckUtils]: 56: Hoare triple {2514#false} ~i~0 := 0bv32; {2514#false} is VALID [2018-11-18 22:07:58,892 INFO L273 TraceCheckUtils]: 57: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:58,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {2514#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2514#false} is VALID [2018-11-18 22:07:58,893 INFO L256 TraceCheckUtils]: 59: Hoare triple {2514#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2514#false} is VALID [2018-11-18 22:07:58,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {2514#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2514#false} is VALID [2018-11-18 22:07:58,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:58,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {2514#false} assume !~bvsgt32(~index, 0bv32); {2514#false} is VALID [2018-11-18 22:07:58,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {2514#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2514#false} is VALID [2018-11-18 22:07:58,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:58,894 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {2514#false} {2514#false} #142#return; {2514#false} is VALID [2018-11-18 22:07:58,895 INFO L273 TraceCheckUtils]: 66: Hoare triple {2514#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2514#false} is VALID [2018-11-18 22:07:58,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2018-11-18 22:07:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:07:58,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:07:59,115 INFO L273 TraceCheckUtils]: 67: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2018-11-18 22:07:59,116 INFO L273 TraceCheckUtils]: 66: Hoare triple {2514#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2514#false} is VALID [2018-11-18 22:07:59,116 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {2513#true} {2514#false} #142#return; {2514#false} is VALID [2018-11-18 22:07:59,116 INFO L273 TraceCheckUtils]: 64: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {2513#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2513#true} is VALID [2018-11-18 22:07:59,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {2513#true} assume !~bvsgt32(~index, 0bv32); {2513#true} is VALID [2018-11-18 22:07:59,117 INFO L273 TraceCheckUtils]: 61: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,117 INFO L273 TraceCheckUtils]: 60: Hoare triple {2513#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2513#true} is VALID [2018-11-18 22:07:59,118 INFO L256 TraceCheckUtils]: 59: Hoare triple {2514#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2513#true} is VALID [2018-11-18 22:07:59,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {2514#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2514#false} is VALID [2018-11-18 22:07:59,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:59,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {2514#false} ~i~0 := 0bv32; {2514#false} is VALID [2018-11-18 22:07:59,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {2514#false} assume !~bvslt32(~i~0, ~len~0); {2514#false} is VALID [2018-11-18 22:07:59,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {2514#false} assume true; {2514#false} is VALID [2018-11-18 22:07:59,119 INFO L273 TraceCheckUtils]: 53: Hoare triple {2514#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2514#false} is VALID [2018-11-18 22:07:59,120 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} {2768#(bvsgt main_~i~0 (_ bv0 32))} #140#return; {2514#false} is VALID [2018-11-18 22:07:59,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} assume true; {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:59,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:59,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {2781#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {2668#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:07:59,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {2781#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} assume true; {2781#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} is VALID [2018-11-18 22:07:59,124 INFO L273 TraceCheckUtils]: 47: Hoare triple {2513#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2781#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} is VALID [2018-11-18 22:07:59,124 INFO L256 TraceCheckUtils]: 46: Hoare triple {2768#(bvsgt main_~i~0 (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2513#true} is VALID [2018-11-18 22:07:59,128 INFO L273 TraceCheckUtils]: 45: Hoare triple {2768#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2768#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:59,132 INFO L273 TraceCheckUtils]: 44: Hoare triple {2768#(bvsgt main_~i~0 (_ bv0 32))} assume true; {2768#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:59,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2768#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:07:59,139 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2513#true} {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #140#return; {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:59,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {2513#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2513#true} is VALID [2018-11-18 22:07:59,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {2513#true} assume !~bvsgt32(~index, 0bv32); {2513#true} is VALID [2018-11-18 22:07:59,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,140 INFO L273 TraceCheckUtils]: 37: Hoare triple {2513#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2513#true} is VALID [2018-11-18 22:07:59,140 INFO L256 TraceCheckUtils]: 36: Hoare triple {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2513#true} is VALID [2018-11-18 22:07:59,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:59,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:59,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {2513#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2797#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:07:59,144 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2513#true} {2513#true} #138#return; {2513#true} is VALID [2018-11-18 22:07:59,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {2513#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2513#true} is VALID [2018-11-18 22:07:59,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {2513#true} assume !~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:59,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {2513#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {2513#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2513#true} {2513#true} #134#return; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {2513#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {2513#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2513#true} is VALID [2018-11-18 22:07:59,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {2513#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; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L256 TraceCheckUtils]: 20: Hoare triple {2513#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {2513#true} assume !!~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {2513#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {2513#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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2513#true} {2513#true} #134#return; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {2513#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {2513#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {2513#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; {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L256 TraceCheckUtils]: 10: Hoare triple {2513#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#true} assume !!~bvsgt32(~len, 0bv32); {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {2513#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2513#true} is VALID [2018-11-18 22:07:59,147 INFO L256 TraceCheckUtils]: 6: Hoare triple {2513#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {2513#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret15 := main(); {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #146#return; {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {2513#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2513#true} is VALID [2018-11-18 22:07:59,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2513#true} is VALID [2018-11-18 22:07:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:07:59,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:07:59,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:07:59,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-18 22:07:59,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:59,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:07:59,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:59,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:07:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:07:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:07:59,257 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 9 states. [2018-11-18 22:08:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:08:00,508 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-11-18 22:08:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:08:00,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-18 22:08:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:08:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:08:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2018-11-18 22:08:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:08:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2018-11-18 22:08:00,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 121 transitions. [2018-11-18 22:08:00,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:08:00,806 INFO L225 Difference]: With dead ends: 115 [2018-11-18 22:08:00,806 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 22:08:00,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:08:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 22:08:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2018-11-18 22:08:00,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:08:00,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 67 states. [2018-11-18 22:08:00,852 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 67 states. [2018-11-18 22:08:00,852 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 67 states. [2018-11-18 22:08:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:08:00,857 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-18 22:08:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-18 22:08:00,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:08:00,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:08:00,858 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 88 states. [2018-11-18 22:08:00,858 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 88 states. [2018-11-18 22:08:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:08:00,862 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-18 22:08:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-18 22:08:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:08:00,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:08:00,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:08:00,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:08:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 22:08:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-18 22:08:00,867 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 68 [2018-11-18 22:08:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:08:00,867 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-18 22:08:00,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:08:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-18 22:08:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 22:08:00,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:08:00,869 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:08:00,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:08:00,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:08:00,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1876272535, now seen corresponding path program 1 times [2018-11-18 22:08:00,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:08:00,870 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:08:00,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:08:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:08:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:08:01,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:08:01,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:08:01,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:08:01,169 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:01,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:01,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:01,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 22:08:01,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-18 22:08:01,337 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:01,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 22:08:01,395 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-18 22:08:01,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 22:08:01,422 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:03,794 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-11-18 22:08:05,907 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:08:05,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:08:05,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:08:05,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:05,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:05,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:05,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-11-18 22:08:08,043 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 22:08:08,200 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 9 treesize of output 7 [2018-11-18 22:08:08,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:08,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:08,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:12 [2018-11-18 22:08:08,216 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:10,274 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-18 22:08:12,361 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:08:14,484 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:08:16,527 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_int| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) (bvadd |c_sll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data)))))) is different from true [2018-11-18 22:08:16,589 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 40 treesize of output 40 [2018-11-18 22:08:16,601 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:08:16,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-18 22:08:16,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:16,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-18 22:08:16,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:16,786 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:08:16,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-18 22:08:16,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:16,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:08:16,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 22:08:16,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:08:16,989 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 22:08:17,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:08:17,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,147 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:55, output treesize:16 [2018-11-18 22:08:17,167 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:17,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 22:08:17,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 22:08:17,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:08:17,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-18 22:08:17,940 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:18,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {3364#true} call ULTIMATE.init(); {3364#true} is VALID [2018-11-18 22:08:18,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3364#true} is VALID [2018-11-18 22:08:18,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-18 22:08:18,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3364#true} {3364#true} #146#return; {3364#true} is VALID [2018-11-18 22:08:18,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {3364#true} call #t~ret15 := main(); {3364#true} is VALID [2018-11-18 22:08:18,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {3364#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:08:18,004 INFO L256 TraceCheckUtils]: 6: Hoare triple {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {3364#true} is VALID [2018-11-18 22:08:18,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {3364#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3364#true} is VALID [2018-11-18 22:08:18,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-18 22:08:18,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {3364#true} assume !!~bvsgt32(~len, 0bv32); {3364#true} is VALID [2018-11-18 22:08:18,005 INFO L256 TraceCheckUtils]: 10: Hoare triple {3364#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3364#true} is VALID [2018-11-18 22:08:18,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {3364#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; {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:18,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:18,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:08:18,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:08:18,016 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {3364#true} #134#return; {3417#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:18,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:18,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:18,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume true; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:18,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:18,020 INFO L256 TraceCheckUtils]: 20: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3434#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:08:18,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {3434#(= |#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; {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:08:18,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:08:18,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:18,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:18,033 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #134#return; {3452#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-18 22:08:18,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {3452#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:18,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:18,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume true; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:18,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:18,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:18,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:18,047 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {3476#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:18,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {3476#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:18,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:18,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:18,053 INFO L256 TraceCheckUtils]: 36: Hoare triple {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3491#(exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))} is VALID [2018-11-18 22:08:18,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {3491#(exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:18,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} assume true; {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:18,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} assume !~bvsgt32(~index, 0bv32); {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:18,057 INFO L273 TraceCheckUtils]: 40: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:18,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} assume true; {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:18,060 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #140#return; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,062 INFO L273 TraceCheckUtils]: 44: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,065 INFO L256 TraceCheckUtils]: 46: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3525#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {3525#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,067 INFO L273 TraceCheckUtils]: 48: Hoare triple {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume true; {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume true; {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume !~bvsgt32(~index, 0bv32); {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:18,091 INFO L273 TraceCheckUtils]: 52: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} is VALID [2018-11-18 22:08:18,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} assume true; {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} is VALID [2018-11-18 22:08:18,123 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #140#return; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,140 INFO L273 TraceCheckUtils]: 59: Hoare triple {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,141 INFO L273 TraceCheckUtils]: 60: Hoare triple {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:18,143 INFO L256 TraceCheckUtils]: 61: Hoare triple {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3577#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:18,144 INFO L273 TraceCheckUtils]: 62: Hoare triple {3577#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:18,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume true; {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:18,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !~bvsgt32(~index, 0bv32); {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:18,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-18 22:08:18,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} assume true; {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-18 22:08:18,150 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #142#return; {3598#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-18 22:08:18,151 INFO L273 TraceCheckUtils]: 68: Hoare triple {3598#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {3365#false} is VALID [2018-11-18 22:08:18,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {3365#false} assume !false; {3365#false} is VALID [2018-11-18 22:08:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-18 22:08:18,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:08:21,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:08:21,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:08:21,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:08:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:08:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:08:21,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:08:21,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:08:21,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:08:21,628 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:21,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:21,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:21,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 22:08:21,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-18 22:08:21,696 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:21,733 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-18 22:08:21,739 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-18 22:08:21,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 22:08:21,770 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:23,824 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_7))) is different from true [2018-11-18 22:08:23,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:08:24,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:08:24,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:24,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-11-18 22:08:24,119 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 9 treesize of output 7 [2018-11-18 22:08:24,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:24,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:12 [2018-11-18 22:08:24,137 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:24,511 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-18 22:08:24,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-18 22:08:24,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 22:08:24,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,625 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 30 treesize of output 32 [2018-11-18 22:08:24,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:08:24,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-18 22:08:24,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:24,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 22:08:24,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:08:24,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-18 22:08:24,741 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:08:24,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:08:24,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:24,833 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:55, output treesize:16 [2018-11-18 22:08:24,848 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:25,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 22:08:25,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 22:08:25,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:25,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:08:25,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:25,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:25,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:25,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-18 22:08:25,186 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:25,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {3364#true} call ULTIMATE.init(); {3364#true} is VALID [2018-11-18 22:08:25,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3364#true} is VALID [2018-11-18 22:08:25,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-18 22:08:25,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3364#true} {3364#true} #146#return; {3364#true} is VALID [2018-11-18 22:08:25,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {3364#true} call #t~ret15 := main(); {3364#true} is VALID [2018-11-18 22:08:25,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {3364#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:08:25,188 INFO L256 TraceCheckUtils]: 6: Hoare triple {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {3364#true} is VALID [2018-11-18 22:08:25,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {3364#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3364#true} is VALID [2018-11-18 22:08:25,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-18 22:08:25,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {3364#true} assume !!~bvsgt32(~len, 0bv32); {3364#true} is VALID [2018-11-18 22:08:25,189 INFO L256 TraceCheckUtils]: 10: Hoare triple {3364#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3364#true} is VALID [2018-11-18 22:08:25,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {3364#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; {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:25,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:25,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {3403#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:08:25,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:08:25,209 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3410#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {3364#true} #134#return; {3417#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:08:25,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:25,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:25,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume true; {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:25,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-18 22:08:25,212 INFO L256 TraceCheckUtils]: 20: Hoare triple {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3434#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:08:25,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {3434#(= |#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; {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:08:25,213 INFO L273 TraceCheckUtils]: 22: Hoare triple {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:08:25,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {3438#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:25,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:25,218 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3445#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {3421#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #134#return; {3452#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-18 22:08:25,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {3452#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~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, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:25,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:25,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume true; {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:25,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-18 22:08:25,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {3456#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:25,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:25,226 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3469#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {3384#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #138#return; {3476#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:25,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {3476#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:25,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:25,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {3480#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:25,232 INFO L256 TraceCheckUtils]: 36: Hoare triple {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3768#(exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_7)))} is VALID [2018-11-18 22:08:25,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {3768#(exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_7)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:25,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} assume true; {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:25,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} assume !~bvsgt32(~index, 0bv32); {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:25,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {3495#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:25,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} assume true; {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} is VALID [2018-11-18 22:08:25,240 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3505#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|))} {3487#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #140#return; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,241 INFO L273 TraceCheckUtils]: 43: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,245 INFO L256 TraceCheckUtils]: 46: Hoare triple {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3525#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {3525#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume true; {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {3529#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume true; {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} assume !~bvsgt32(~index, 0bv32); {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} is VALID [2018-11-18 22:08:25,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {3536#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} is VALID [2018-11-18 22:08:25,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} assume true; {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} is VALID [2018-11-18 22:08:25,260 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {3546#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)))))} {3512#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #140#return; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,279 INFO L273 TraceCheckUtils]: 56: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {3553#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {3566#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:08:25,287 INFO L256 TraceCheckUtils]: 61: Hoare triple {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3577#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:25,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {3577#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:25,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume true; {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:25,290 INFO L273 TraceCheckUtils]: 64: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !~bvsgt32(~index, 0bv32); {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-18 22:08:25,291 INFO L273 TraceCheckUtils]: 65: Hoare triple {3581#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-18 22:08:25,291 INFO L273 TraceCheckUtils]: 66: Hoare triple {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} assume true; {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-18 22:08:25,294 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3591#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} {3573#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #142#return; {3598#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-18 22:08:25,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {3598#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {3365#false} is VALID [2018-11-18 22:08:25,295 INFO L273 TraceCheckUtils]: 69: Hoare triple {3365#false} assume !false; {3365#false} is VALID [2018-11-18 22:08:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-18 22:08:25,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:08:27,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:08:27,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-18 22:08:27,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-11-18 22:08:27,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:08:27,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:08:28,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:08:28,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:08:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:08:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1167, Unknown=4, NotChecked=210, Total=1482 [2018-11-18 22:08:28,362 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 32 states.