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_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:25:59,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:25:59,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:25:59,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:25:59,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:25:59,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:25:59,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:25:59,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:25:59,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:25:59,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:25:59,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:25:59,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:25:59,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:25:59,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:25:59,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:25:59,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:25:59,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:25:59,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:25:59,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:25:59,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:25:59,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:25:59,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:25:59,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:25:59,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:25:59,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:25:59,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:25:59,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:25:59,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:25:59,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:25:59,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:25:59,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:25:59,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:25:59,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:25:59,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:25:59,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:25:59,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:25:59,608 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:25:59,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:25:59,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:25:59,625 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:25:59,625 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:25:59,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:25:59,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:25:59,626 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:25:59,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:25:59,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:25:59,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:25:59,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:25:59,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:25:59,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:25:59,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:25:59,627 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:25:59,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:25:59,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:25:59,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:25:59,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:25:59,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:25:59,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:25:59,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:25:59,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:25:59,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:25:59,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:25:59,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:25:59,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:25:59,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:25:59,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:25:59,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:25:59,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:25:59,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:25:59,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:25:59,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:25:59,702 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:25:59,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:59,773 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6130c6bf/e2b2be19997a4e37a10edc4e3ff3c956/FLAG267c18f3a [2018-11-14 17:26:00,293 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:26:00,294 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:26:00,310 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6130c6bf/e2b2be19997a4e37a10edc4e3ff3c956/FLAG267c18f3a [2018-11-14 17:26:00,326 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6130c6bf/e2b2be19997a4e37a10edc4e3ff3c956 [2018-11-14 17:26:00,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:26:00,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:26:00,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:26:00,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:26:00,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:26:00,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:26:00" (1/1) ... [2018-11-14 17:26:00,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d35b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:00, skipping insertion in model container [2018-11-14 17:26:00,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:26:00" (1/1) ... [2018-11-14 17:26:00,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:26:00,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:26:00,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:26:00,842 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:26:00,921 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:26:01,074 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:26:01,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01 WrapperNode [2018-11-14 17:26:01,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:26:01,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:26:01,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:26:01,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:26:01,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... [2018-11-14 17:26:01,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:26:01,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:26:01,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:26:01,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:26:01,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:26:01,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 17:26:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-14 17:26:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-14 17:26:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-14 17:26:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:26:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:26:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:26:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:26:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:26:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:26:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:26:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:26:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:26:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:26:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:26:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:26:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:26:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:26:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:26:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:26:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:26:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:26:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:26:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:26:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:26:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:26:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-14 17:26:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:26:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:26:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:26:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:26:02,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:26:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:26:02 BoogieIcfgContainer [2018-11-14 17:26:02,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:26:02,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:26:02,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:26:02,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:26:02,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:26:00" (1/3) ... [2018-11-14 17:26:02,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a720146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:26:02, skipping insertion in model container [2018-11-14 17:26:02,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:01" (2/3) ... [2018-11-14 17:26:02,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a720146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:26:02, skipping insertion in model container [2018-11-14 17:26:02,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:26:02" (3/3) ... [2018-11-14 17:26:02,422 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:26:02,433 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:26:02,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:26:02,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:26:02,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:26:02,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:26:02,499 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:26:02,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:26:02,500 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:26:02,503 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:26:02,503 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:26:02,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:26:02,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:26:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 17:26:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:26:02,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:26:02,534 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, 1] [2018-11-14 17:26:02,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:26:02,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:26:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash -990460302, now seen corresponding path program 1 times [2018-11-14 17:26:02,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:26:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:26:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:02,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:02,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 17:26:02,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-14 17:26:02,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 17:26:02,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #131#return; {57#true} is VALID [2018-11-14 17:26:02,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2018-11-14 17:26:02,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {57#true} is VALID [2018-11-14 17:26:02,759 INFO L256 TraceCheckUtils]: 6: Hoare triple {57#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-14 17:26:02,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {57#true} is VALID [2018-11-14 17:26:02,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 17:26:02,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 17:26:02,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 17:26:02,774 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#false} {57#true} #121#return; {58#false} is VALID [2018-11-14 17:26:02,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {58#false} is VALID [2018-11-14 17:26:02,774 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {57#true} is VALID [2018-11-14 17:26:02,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {57#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {57#true} is VALID [2018-11-14 17:26:02,775 INFO L256 TraceCheckUtils]: 15: Hoare triple {57#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {57#true} is VALID [2018-11-14 17:26:02,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {57#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {57#true} is VALID [2018-11-14 17:26:02,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {57#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {57#true} is VALID [2018-11-14 17:26:02,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {57#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {57#true} is VALID [2018-11-14 17:26:02,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 17:26:02,777 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {57#true} {57#true} #129#return; {57#true} is VALID [2018-11-14 17:26:02,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {57#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {57#true} is VALID [2018-11-14 17:26:02,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {57#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {57#true} is VALID [2018-11-14 17:26:02,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {57#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {57#true} is VALID [2018-11-14 17:26:02,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 17:26:02,778 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {57#true} {58#false} #123#return; {58#false} is VALID [2018-11-14 17:26:02,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {58#false} is VALID [2018-11-14 17:26:02,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {58#false} is VALID [2018-11-14 17:26:02,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 17:26:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:02,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:26:02,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:26:02,795 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 17:26:02,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:26:02,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:26:03,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:26:03,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:26:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:26:03,032 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 17:26:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:03,672 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-14 17:26:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:26:03,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 17:26:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:26:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:26:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 17:26:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:26:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 17:26:03,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-14 17:26:04,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:04,281 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:26:04,281 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:26:04,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:26:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:26:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 17:26:04,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:26:04,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 17:26:04,342 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:26:04,343 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:26:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:04,349 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 17:26:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:26:04,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:04,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:04,351 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:26:04,351 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:26:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:04,356 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 17:26:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:26:04,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:04,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:04,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:26:04,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:26:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:26:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:26:04,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2018-11-14 17:26:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:26:04,363 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:26:04,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:26:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:26:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:26:04,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:26:04,365 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, 1, 1] [2018-11-14 17:26:04,366 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:26:04,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:26:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1702614640, now seen corresponding path program 1 times [2018-11-14 17:26:04,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:26:04,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:26:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:04,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:04,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {314#true} is VALID [2018-11-14 17:26:04,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {314#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {314#true} is VALID [2018-11-14 17:26:04,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2018-11-14 17:26:04,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #131#return; {314#true} is VALID [2018-11-14 17:26:04,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret18 := main(); {314#true} is VALID [2018-11-14 17:26:04,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {316#(<= 2 main_~len~0)} is VALID [2018-11-14 17:26:04,554 INFO L256 TraceCheckUtils]: 6: Hoare triple {316#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {314#true} is VALID [2018-11-14 17:26:04,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {317#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:04,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {317#(<= |dll_create_#in~len| dll_create_~len)} assume true; {317#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:04,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {317#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {318#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 17:26:04,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {318#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {318#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 17:26:04,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {318#(<= |dll_create_#in~len| 0)} assume true; {318#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 17:26:04,566 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {318#(<= |dll_create_#in~len| 0)} {316#(<= 2 main_~len~0)} #121#return; {315#false} is VALID [2018-11-14 17:26:04,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {315#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {315#false} is VALID [2018-11-14 17:26:04,567 INFO L256 TraceCheckUtils]: 14: Hoare triple {315#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {314#true} is VALID [2018-11-14 17:26:04,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {314#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {314#true} is VALID [2018-11-14 17:26:04,568 INFO L256 TraceCheckUtils]: 16: Hoare triple {314#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {314#true} is VALID [2018-11-14 17:26:04,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {314#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {314#true} is VALID [2018-11-14 17:26:04,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {314#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {314#true} is VALID [2018-11-14 17:26:04,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {314#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {314#true} is VALID [2018-11-14 17:26:04,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {314#true} assume true; {314#true} is VALID [2018-11-14 17:26:04,570 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {314#true} {314#true} #129#return; {314#true} is VALID [2018-11-14 17:26:04,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {314#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {314#true} is VALID [2018-11-14 17:26:04,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {314#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {314#true} is VALID [2018-11-14 17:26:04,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {314#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {314#true} is VALID [2018-11-14 17:26:04,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {314#true} assume true; {314#true} is VALID [2018-11-14 17:26:04,571 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {314#true} {315#false} #123#return; {315#false} is VALID [2018-11-14 17:26:04,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {315#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {315#false} is VALID [2018-11-14 17:26:04,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {315#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {315#false} is VALID [2018-11-14 17:26:04,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {315#false} assume !false; {315#false} is VALID [2018-11-14 17:26:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:04,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:26:04,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:26:04,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:26:04,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:26:04,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:26:04,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:04,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:26:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:26:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:26:04,689 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-14 17:26:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:05,078 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-14 17:26:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:26:05,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:26:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:26:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:26:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 17:26:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:26:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 17:26:05,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-14 17:26:05,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:05,236 INFO L225 Difference]: With dead ends: 70 [2018-11-14 17:26:05,236 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:26:05,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:26:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:26:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-14 17:26:05,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:26:05,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2018-11-14 17:26:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2018-11-14 17:26:05,262 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2018-11-14 17:26:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:05,266 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 17:26:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 17:26:05,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:05,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:05,267 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2018-11-14 17:26:05,267 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2018-11-14 17:26:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:05,271 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 17:26:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 17:26:05,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:05,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:05,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:26:05,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:26:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:26:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 17:26:05,275 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2018-11-14 17:26:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:26:05,276 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 17:26:05,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:26:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 17:26:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:26:05,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:26:05,278 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] [2018-11-14 17:26:05,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:26:05,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:26:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1826631930, now seen corresponding path program 1 times [2018-11-14 17:26:05,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:26:05,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:26:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:05,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:05,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:05,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2018-11-14 17:26:05,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {558#true} is VALID [2018-11-14 17:26:05,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2018-11-14 17:26:05,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #131#return; {558#true} is VALID [2018-11-14 17:26:05,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret18 := main(); {558#true} is VALID [2018-11-14 17:26:05,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {560#(<= 2 main_~len~0)} is VALID [2018-11-14 17:26:05,474 INFO L256 TraceCheckUtils]: 6: Hoare triple {560#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {558#true} is VALID [2018-11-14 17:26:05,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume true; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:05,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 17:26:05,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 17:26:05,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:05,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {563#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:05,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#(<= |dll_create_#in~len| 1)} assume true; {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:05,512 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {563#(<= |dll_create_#in~len| 1)} {560#(<= 2 main_~len~0)} #121#return; {559#false} is VALID [2018-11-14 17:26:05,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {559#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {559#false} is VALID [2018-11-14 17:26:05,513 INFO L256 TraceCheckUtils]: 20: Hoare triple {559#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {558#true} is VALID [2018-11-14 17:26:05,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {558#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {558#true} is VALID [2018-11-14 17:26:05,513 INFO L256 TraceCheckUtils]: 22: Hoare triple {558#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {558#true} is VALID [2018-11-14 17:26:05,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {558#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {558#true} is VALID [2018-11-14 17:26:05,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {558#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {558#true} is VALID [2018-11-14 17:26:05,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {558#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {558#true} is VALID [2018-11-14 17:26:05,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {558#true} assume true; {558#true} is VALID [2018-11-14 17:26:05,515 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {558#true} {558#true} #129#return; {558#true} is VALID [2018-11-14 17:26:05,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {558#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {558#true} is VALID [2018-11-14 17:26:05,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {558#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {558#true} is VALID [2018-11-14 17:26:05,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {558#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {558#true} is VALID [2018-11-14 17:26:05,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {558#true} assume true; {558#true} is VALID [2018-11-14 17:26:05,516 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {558#true} {559#false} #123#return; {559#false} is VALID [2018-11-14 17:26:05,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {559#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {559#false} is VALID [2018-11-14 17:26:05,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {559#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {559#false} is VALID [2018-11-14 17:26:05,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {559#false} assume !false; {559#false} is VALID [2018-11-14 17:26:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:05,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:26:05,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:26:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:05,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:26:06,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2018-11-14 17:26:06,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {558#true} is VALID [2018-11-14 17:26:06,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2018-11-14 17:26:06,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #131#return; {558#true} is VALID [2018-11-14 17:26:06,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret18 := main(); {558#true} is VALID [2018-11-14 17:26:06,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {560#(<= 2 main_~len~0)} is VALID [2018-11-14 17:26:06,008 INFO L256 TraceCheckUtils]: 6: Hoare triple {560#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {558#true} is VALID [2018-11-14 17:26:06,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume true; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {561#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 17:26:06,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {561#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 17:26:06,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 17:26:06,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {562#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:06,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {563#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:06,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#(<= |dll_create_#in~len| 1)} assume true; {563#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 17:26:06,035 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {563#(<= |dll_create_#in~len| 1)} {560#(<= 2 main_~len~0)} #121#return; {559#false} is VALID [2018-11-14 17:26:06,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {559#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {559#false} is VALID [2018-11-14 17:26:06,035 INFO L256 TraceCheckUtils]: 20: Hoare triple {559#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {559#false} is VALID [2018-11-14 17:26:06,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {559#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {559#false} is VALID [2018-11-14 17:26:06,036 INFO L256 TraceCheckUtils]: 22: Hoare triple {559#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {559#false} is VALID [2018-11-14 17:26:06,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {559#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {559#false} is VALID [2018-11-14 17:26:06,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {559#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {559#false} is VALID [2018-11-14 17:26:06,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {559#false} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {559#false} is VALID [2018-11-14 17:26:06,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {559#false} assume true; {559#false} is VALID [2018-11-14 17:26:06,037 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {559#false} {559#false} #129#return; {559#false} is VALID [2018-11-14 17:26:06,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {559#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {559#false} is VALID [2018-11-14 17:26:06,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {559#false} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {559#false} is VALID [2018-11-14 17:26:06,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {559#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {559#false} is VALID [2018-11-14 17:26:06,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {559#false} assume true; {559#false} is VALID [2018-11-14 17:26:06,039 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {559#false} {559#false} #123#return; {559#false} is VALID [2018-11-14 17:26:06,039 INFO L273 TraceCheckUtils]: 33: Hoare triple {559#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {559#false} is VALID [2018-11-14 17:26:06,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {559#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {559#false} is VALID [2018-11-14 17:26:06,040 INFO L273 TraceCheckUtils]: 35: Hoare triple {559#false} assume !false; {559#false} is VALID [2018-11-14 17:26:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:26:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:26:06,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 17:26:06,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:26:06,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:26:06,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:06,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:26:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:26:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:26:06,213 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 6 states. [2018-11-14 17:26:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:06,666 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:26:06,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:26:06,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 17:26:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:26:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:26:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-14 17:26:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:26:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-14 17:26:06,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2018-11-14 17:26:06,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:06,863 INFO L225 Difference]: With dead ends: 76 [2018-11-14 17:26:06,863 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:26:06,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:26:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:26:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 17:26:06,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:26:06,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 17:26:06,897 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 17:26:06,898 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 17:26:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:06,903 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 17:26:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 17:26:06,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:06,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:06,904 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 17:26:06,905 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 17:26:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:06,913 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 17:26:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 17:26:06,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:06,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:06,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:26:06,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:26:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:26:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 17:26:06,918 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2018-11-14 17:26:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:26:06,919 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 17:26:06,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:26:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:26:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:26:06,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:26:06,926 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:26:06,927 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:26:06,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:26:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -835388412, now seen corresponding path program 2 times [2018-11-14 17:26:06,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:26:06,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:26:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:07,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2018-11-14 17:26:07,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {934#true} is VALID [2018-11-14 17:26:07,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:07,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #131#return; {934#true} is VALID [2018-11-14 17:26:07,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret18 := main(); {934#true} is VALID [2018-11-14 17:26:07,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {934#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {934#true} is VALID [2018-11-14 17:26:07,069 INFO L256 TraceCheckUtils]: 6: Hoare triple {934#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {934#true} is VALID [2018-11-14 17:26:07,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {934#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {934#true} is VALID [2018-11-14 17:26:07,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:07,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {934#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {936#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-14 17:26:07,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {936#(not (= 0 dll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {936#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-14 17:26:07,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {936#(not (= 0 dll_create_~new_head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {936#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-14 17:26:07,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {936#(not (= 0 dll_create_~new_head~0.base))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {936#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-14 17:26:07,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {936#(not (= 0 dll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {937#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-14 17:26:07,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {937#(not (= 0 dll_create_~head~0.base))} assume true; {937#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-14 17:26:07,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {937#(not (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {937#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-14 17:26:07,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {937#(not (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {937#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-14 17:26:07,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {937#(not (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {937#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-14 17:26:07,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {937#(not (= 0 dll_create_~head~0.base))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {935#false} is VALID [2018-11-14 17:26:07,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {935#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {935#false} is VALID [2018-11-14 17:26:07,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {935#false} assume true; {935#false} is VALID [2018-11-14 17:26:07,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {935#false} assume !(~len > 0); {935#false} is VALID [2018-11-14 17:26:07,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {935#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {935#false} is VALID [2018-11-14 17:26:07,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {935#false} assume true; {935#false} is VALID [2018-11-14 17:26:07,084 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {935#false} {934#true} #121#return; {935#false} is VALID [2018-11-14 17:26:07,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {935#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {935#false} is VALID [2018-11-14 17:26:07,085 INFO L256 TraceCheckUtils]: 26: Hoare triple {935#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {934#true} is VALID [2018-11-14 17:26:07,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {934#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {934#true} is VALID [2018-11-14 17:26:07,085 INFO L256 TraceCheckUtils]: 28: Hoare triple {934#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {934#true} is VALID [2018-11-14 17:26:07,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {934#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {934#true} is VALID [2018-11-14 17:26:07,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {934#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {934#true} is VALID [2018-11-14 17:26:07,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {934#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {934#true} is VALID [2018-11-14 17:26:07,086 INFO L273 TraceCheckUtils]: 32: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:07,086 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {934#true} {934#true} #129#return; {934#true} is VALID [2018-11-14 17:26:07,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {934#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {934#true} is VALID [2018-11-14 17:26:07,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {934#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {934#true} is VALID [2018-11-14 17:26:07,087 INFO L273 TraceCheckUtils]: 36: Hoare triple {934#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {934#true} is VALID [2018-11-14 17:26:07,087 INFO L273 TraceCheckUtils]: 37: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:07,087 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {934#true} {935#false} #123#return; {935#false} is VALID [2018-11-14 17:26:07,088 INFO L273 TraceCheckUtils]: 39: Hoare triple {935#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {935#false} is VALID [2018-11-14 17:26:07,088 INFO L273 TraceCheckUtils]: 40: Hoare triple {935#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {935#false} is VALID [2018-11-14 17:26:07,088 INFO L273 TraceCheckUtils]: 41: Hoare triple {935#false} assume !false; {935#false} is VALID [2018-11-14 17:26:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:07,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:26:07,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:26:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:26:07,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:26:07,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:26:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:07,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:26:07,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:26:07,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:26:07,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-14 17:26:07,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:26:07,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:26:07,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:26:07,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:26:07,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:07,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:08,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:08,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-14 17:26:08,118 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:08,225 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 31 treesize of output 27 [2018-11-14 17:26:08,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-14 17:26:08,235 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-14 17:26:08,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:08,253 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 23 treesize of output 19 [2018-11-14 17:26:08,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 17:26:08,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:08,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:08,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:26:08,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:26:08,291 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:08,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:08,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:08,300 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:7 [2018-11-14 17:26:08,303 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:08,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2018-11-14 17:26:08,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {934#true} is VALID [2018-11-14 17:26:08,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:08,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #131#return; {934#true} is VALID [2018-11-14 17:26:08,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret18 := main(); {934#true} is VALID [2018-11-14 17:26:08,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {934#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {956#(= |main_~#s~0.offset| 0)} is VALID [2018-11-14 17:26:08,327 INFO L256 TraceCheckUtils]: 6: Hoare triple {956#(= |main_~#s~0.offset| 0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {934#true} is VALID [2018-11-14 17:26:08,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {934#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {934#true} is VALID [2018-11-14 17:26:08,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:08,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {934#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {934#true} is VALID [2018-11-14 17:26:08,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {934#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {934#true} is VALID [2018-11-14 17:26:08,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {934#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {934#true} is VALID [2018-11-14 17:26:08,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {934#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {934#true} is VALID [2018-11-14 17:26:08,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {934#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {934#true} is VALID [2018-11-14 17:26:08,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:08,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {934#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {934#true} is VALID [2018-11-14 17:26:08,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {934#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {934#true} is VALID [2018-11-14 17:26:08,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {934#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {934#true} is VALID [2018-11-14 17:26:08,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {934#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {934#true} is VALID [2018-11-14 17:26:08,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {934#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {934#true} is VALID [2018-11-14 17:26:08,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:08,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {934#true} assume !(~len > 0); {934#true} is VALID [2018-11-14 17:26:08,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {934#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {934#true} is VALID [2018-11-14 17:26:08,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {934#true} assume true; {934#true} is VALID [2018-11-14 17:26:08,358 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {934#true} {956#(= |main_~#s~0.offset| 0)} #121#return; {956#(= |main_~#s~0.offset| 0)} is VALID [2018-11-14 17:26:08,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {956#(= |main_~#s~0.offset| 0)} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1017#(and (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} is VALID [2018-11-14 17:26:08,372 INFO L256 TraceCheckUtils]: 26: Hoare triple {1017#(and (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {934#true} is VALID [2018-11-14 17:26:08,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {934#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1024#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:26:08,380 INFO L256 TraceCheckUtils]: 28: Hoare triple {1024#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {934#true} is VALID [2018-11-14 17:26:08,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {934#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1031#(= node_create_~data |node_create_#in~data|)} is VALID [2018-11-14 17:26:08,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {1031#(= node_create_~data |node_create_#in~data|)} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1031#(= node_create_~data |node_create_#in~data|)} is VALID [2018-11-14 17:26:08,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {1031#(= node_create_~data |node_create_#in~data|)} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1038#(= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|))} is VALID [2018-11-14 17:26:08,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {1038#(= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|))} assume true; {1038#(= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|))} is VALID [2018-11-14 17:26:08,391 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1038#(= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|))} {1024#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} #129#return; {1045#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:26:08,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {1045#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1049#(and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:26:08,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {1049#(and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {1049#(and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:26:08,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {1049#(and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1056#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|)} is VALID [2018-11-14 17:26:08,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {1056#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|)} assume true; {1056#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|)} is VALID [2018-11-14 17:26:08,402 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1056#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|)} {1017#(and (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} #123#return; {1063#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) main_~uneq~0) (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} is VALID [2018-11-14 17:26:08,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {1063#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) main_~uneq~0) (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {1067#(and (= |main_#t~mem12| main_~uneq~0) (= main_~uneq~0 5))} is VALID [2018-11-14 17:26:08,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {1067#(and (= |main_#t~mem12| main_~uneq~0) (= main_~uneq~0 5))} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {935#false} is VALID [2018-11-14 17:26:08,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {935#false} assume !false; {935#false} is VALID [2018-11-14 17:26:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:26:08,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:26:08,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-14 17:26:08,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 17:26:08,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:26:08,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:26:08,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:08,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:26:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:26:08,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:26:08,522 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 14 states. [2018-11-14 17:26:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:10,209 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-14 17:26:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:26:10,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 17:26:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:26:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:26:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2018-11-14 17:26:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:26:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2018-11-14 17:26:10,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 87 transitions. [2018-11-14 17:26:10,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:26:10,491 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:26:10,491 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:26:10,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:26:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:26:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 17:26:10,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:26:10,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 17:26:10,545 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:26:10,546 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:26:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:10,549 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 17:26:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:26:10,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:10,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:10,550 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:26:10,550 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:26:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:26:10,552 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 17:26:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:26:10,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:26:10,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:26:10,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:26:10,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:26:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:26:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:26:10,555 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 42 [2018-11-14 17:26:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:26:10,556 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:26:10,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:26:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:26:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:26:10,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:26:10,557 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:26:10,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:26:10,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:26:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 357312105, now seen corresponding path program 1 times [2018-11-14 17:26:10,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:26:10,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:26:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:10,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:26:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:26:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:11,852 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-14 17:26:12,284 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-14 17:26:12,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2018-11-14 17:26:12,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1343#true} is VALID [2018-11-14 17:26:12,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2018-11-14 17:26:12,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #131#return; {1343#true} is VALID [2018-11-14 17:26:12,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret18 := main(); {1343#true} is VALID [2018-11-14 17:26:12,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {1343#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1345#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-14 17:26:12,778 INFO L256 TraceCheckUtils]: 6: Hoare triple {1345#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:26:12,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {1346#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:26:12,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {1346#(= |#valid| |old(#valid)|)} assume true; {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:26:12,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {1346#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {1347#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 8, 4); {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {1348#(and (not (= 0 dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(~len > 0); {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {1349#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1350#(and (not (= 0 |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| |dll_create_#res.base|) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {1350#(and (not (= 0 |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| |dll_create_#res.base|) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1350#(and (not (= 0 |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| |dll_create_#res.base|) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:26:12,809 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1350#(and (not (= 0 |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| |dll_create_#res.base|) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1345#(= (select |#valid| |main_~#s~0.base|) 1)} #121#return; {1351#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_#t~ret10.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 17:26:12,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {1351#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_#t~ret10.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1352#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 17:26:12,812 INFO L256 TraceCheckUtils]: 26: Hoare triple {1352#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:26:12,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1354#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-14 17:26:12,814 INFO L256 TraceCheckUtils]: 28: Hoare triple {1354#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:26:12,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1355#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:26:12,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {1355#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1355#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:26:12,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {1355#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1356#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-14 17:26:12,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {1356#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} assume true; {1356#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-14 17:26:12,821 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1356#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} {1354#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} #129#return; {1357#(and (= 0 |dll_prepend_#t~ret6.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |dll_prepend_#t~ret6.base| dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-14 17:26:12,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {1357#(and (= 0 |dll_prepend_#t~ret6.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |dll_prepend_#t~ret6.base| dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1358#(and (or (not (= dll_prepend_~head.base dll_prepend_~new_head~1.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~head.base dll_prepend_~new_head~1.base) (and (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (or (and (= 0 dll_prepend_~new_head~1.offset) (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} is VALID [2018-11-14 17:26:12,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {1358#(and (or (not (= dll_prepend_~head.base dll_prepend_~new_head~1.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~head.base dll_prepend_~new_head~1.base) (and (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (or (and (= 0 dll_prepend_~new_head~1.offset) (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {1359#(and (or (not (= dll_prepend_~head.base dll_prepend_~new_head~1.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~head.base dll_prepend_~new_head~1.base) (and (or (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| dll_prepend_~head.base (store (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= 0 dll_prepend_~new_head~1.offset) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} is VALID [2018-11-14 17:26:12,826 INFO L273 TraceCheckUtils]: 36: Hoare triple {1359#(and (or (not (= dll_prepend_~head.base dll_prepend_~new_head~1.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~head.base dll_prepend_~new_head~1.base) (and (or (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| dll_prepend_~head.base (store (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= 0 dll_prepend_~new_head~1.offset) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1360#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-14 17:26:12,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {1360#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} assume true; {1360#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-14 17:26:12,831 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1360#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} {1352#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} #123#return; {1361#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:26:12,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {1361#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {1362#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} is VALID [2018-11-14 17:26:12,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {1362#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !(~uneq~0 != #t~mem12);havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset + 4, 4);~ptr~0.base, ~ptr~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;~count~0 := 1; {1363#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-14 17:26:12,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {1363#(not (= 0 main_~ptr~0.base))} assume true; {1363#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-14 17:26:12,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {1363#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1344#false} is VALID [2018-11-14 17:26:12,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {1344#false} assume ~count~0 != 1 + ~len~0; {1344#false} is VALID [2018-11-14 17:26:12,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2018-11-14 17:26:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:26:12,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:26:12,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:26:12,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:26:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:26:12,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:26:12,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 17:26:12,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:12,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:12,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 17:26:12,998 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:17,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:26:17,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:26:17,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:26:17,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-14 17:26:17,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-14 17:26:17,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:17,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:17,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:17,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-14 17:26:20,002 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:20,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:26:20,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:26:20,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:20,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:20,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:20,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:51 [2018-11-14 17:26:20,155 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:21,772 WARN L179 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-14 17:26:23,565 WARN L179 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-14 17:26:24,775 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-14 17:26:24,795 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 181 treesize of output 179 [2018-11-14 17:26:24,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 177 [2018-11-14 17:26:24,805 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-14 17:26:24,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:24,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:24,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:193, output treesize:189 [2018-11-14 17:26:26,854 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:26:32,990 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 17:26:33,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:26:33,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:26:33,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:26:33,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:26:33,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 17:26:33,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:376, output treesize:397 [2018-11-14 17:26:33,558 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:27:04,772 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2018-11-14 17:27:04,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-14 17:27:04,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:04,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:04,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:27:04,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 203 [2018-11-14 17:27:05,018 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 103 [2018-11-14 17:27:05,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:05,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 100 [2018-11-14 17:27:05,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-11-14 17:27:05,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 69 [2018-11-14 17:27:05,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:27:05,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,195 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 113 [2018-11-14 17:27:05,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 17:27:05,262 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:05,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2018-11-14 17:27:05,297 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:27:05,319 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:27:05,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-14 17:27:05,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-14 17:27:05,581 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:27:05,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:05,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:05,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:27:05,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 83 [2018-11-14 17:27:05,751 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-14 17:27:05,816 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:27:05,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:27:06,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-14 17:27:06,005 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:447, output treesize:350 [2018-11-14 17:27:06,050 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:27:06,378 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-14 17:27:06,483 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 123 treesize of output 111 [2018-11-14 17:27:06,491 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 96 treesize of output 81 [2018-11-14 17:27:06,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,600 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 125 treesize of output 113 [2018-11-14 17:27:06,606 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 98 treesize of output 83 [2018-11-14 17:27:06,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,711 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 134 treesize of output 124 [2018-11-14 17:27:06,717 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 83 treesize of output 70 [2018-11-14 17:27:06,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:06,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-14 17:27:06,822 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:383, output treesize:306 [2018-11-14 17:27:06,842 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:27:07,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 59 [2018-11-14 17:27:07,265 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 9 treesize of output 1 [2018-11-14 17:27:07,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 17:27:07,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-11-14 17:27:07,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 68 [2018-11-14 17:27:07,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:27:07,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-14 17:27:07,550 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-14 17:27:07,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-14 17:27:07,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 61 [2018-11-14 17:27:07,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 17:27:07,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 17:27:07,754 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2018-11-14 17:27:07,769 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,774 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:27:07,800 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:324, output treesize:4 [2018-11-14 17:27:07,806 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:27:07,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2018-11-14 17:27:07,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1343#true} is VALID [2018-11-14 17:27:07,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2018-11-14 17:27:07,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #131#return; {1343#true} is VALID [2018-11-14 17:27:07,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret18 := main(); {1343#true} is VALID [2018-11-14 17:27:07,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1343#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1382#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 17:27:07,813 INFO L256 TraceCheckUtils]: 6: Hoare triple {1382#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:27:07,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {1346#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:27:07,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {1346#(= |#valid| |old(#valid)|)} assume true; {1346#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:27:07,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {1346#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} assume true; {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} is VALID [2018-11-14 17:27:07,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {1395#(exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| 1))))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1414#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (= 0 dll_create_~new_head~0.offset))} is VALID [2018-11-14 17:27:07,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {1414#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (= 0 dll_create_~new_head~0.offset))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} is VALID [2018-11-14 17:27:07,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 8, 4); {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} is VALID [2018-11-14 17:27:07,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 8, 4); {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} is VALID [2018-11-14 17:27:07,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {1418#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base 1)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~new_head~0.base)))) (not (= dll_create_~new_head~0.base 0)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} is VALID [2018-11-14 17:27:07,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} assume true; {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} is VALID [2018-11-14 17:27:07,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} assume !(~len > 0); {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} is VALID [2018-11-14 17:27:07,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1428#(and (not (= 0 dll_create_~head~0.base)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= 0 (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) dll_create_~head~0.base 1)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1438#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base| 1)) (= (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base|) 0))) (not (= |dll_create_#res.base| 0)))} is VALID [2018-11-14 17:27:07,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {1438#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base| 1)) (= (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base|) 0))) (not (= |dll_create_#res.base| 0)))} assume true; {1438#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base| 1)) (= (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base|) 0))) (not (= |dll_create_#res.base| 0)))} is VALID [2018-11-14 17:27:07,833 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1438#(and (exists ((|dll_create_#t~malloc3.base| Int)) (and (= 0 (select |old(#valid)| |dll_create_#t~malloc3.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base| 1)) (= (select (store |old(#valid)| |dll_create_#t~malloc3.base| 1) |dll_create_#res.base|) 0))) (not (= |dll_create_#res.base| 0)))} {1382#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #121#return; {1445#(and (not (= 0 |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (not (= |dll_create_#t~malloc3.base| |main_#t~ret10.base|)) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)))) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 17:27:07,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {1445#(and (not (= 0 |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| Int)) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (not (= |dll_create_#t~malloc3.base| |main_#t~ret10.base|)) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)))) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1449#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((|dll_create_#t~malloc3.base| Int)) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |dll_create_#t~malloc3.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 17:27:07,836 INFO L256 TraceCheckUtils]: 26: Hoare triple {1449#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((|dll_create_#t~malloc3.base| Int)) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |dll_create_#t~malloc3.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:27:07,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1456#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:27:07,839 INFO L256 TraceCheckUtils]: 28: Hoare triple {1456#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:27:07,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {1353#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1463#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:27:07,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {1463#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1463#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:27:07,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {1463#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 8, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1470#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))))} is VALID [2018-11-14 17:27:07,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {1470#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))))} assume true; {1470#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))))} is VALID [2018-11-14 17:27:07,845 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1470#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))))} {1456#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} #129#return; {1477#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:27:07,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {1477#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~new_head~1.offset + 4, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1481#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-14 17:27:09,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {1481#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, #t~mem9.offset + 8, 4);havoc #t~mem9.base, #t~mem9.offset; {1485#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is UNKNOWN [2018-11-14 17:27:11,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {1485#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1489#(exists ((dll_prepend_~new_head~1.base Int) (node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))))} is UNKNOWN [2018-11-14 17:27:11,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {1489#(exists ((dll_prepend_~new_head~1.base Int) (node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))))} assume true; {1489#(exists ((dll_prepend_~new_head~1.base Int) (node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))))} is VALID [2018-11-14 17:27:11,865 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1489#(exists ((dll_prepend_~new_head~1.base Int) (node_create_~temp~0.offset Int) (v_arrayElimCell_11 Int)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ v_arrayElimCell_11 8) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))))} {1449#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((|dll_create_#t~malloc3.base| Int)) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |dll_create_#t~malloc3.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} #123#return; {1496#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (exists ((v_arrayElimCell_11 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_arrayElimCell_11 8))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (exists ((v_prenex_1 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_prenex_1 8)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (exists ((node_create_~temp~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ node_create_~temp~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ node_create_~temp~0.offset 8)) 0))) (exists ((v_prenex_2 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_prenex_2 8)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))))))} is VALID [2018-11-14 17:27:11,868 INFO L273 TraceCheckUtils]: 39: Hoare triple {1496#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (exists ((v_arrayElimCell_11 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_arrayElimCell_11 8))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (exists ((v_prenex_1 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_prenex_1 8)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (exists ((node_create_~temp~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ node_create_~temp~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ node_create_~temp~0.offset 8)) 0))) (exists ((v_prenex_2 Int)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (+ v_prenex_2 8)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset + 0, 4); {1500#(or (exists ((v_prenex_5 Int) (v_prenex_2 Int) (node_create_~temp~0.offset Int)) (and (not (= v_prenex_5 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4))) (+ v_prenex_2 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ node_create_~temp~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ node_create_~temp~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (not (= v_prenex_5 (select (select |#memory_$Pointer$.base| v_prenex_5) 0))))) (exists ((|main_~#s~0.base| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4))) (+ v_prenex_1 8))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) main_~ptr~0.offset) 0))) (exists ((v_prenex_3 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4))) (+ v_arrayElimCell_11 8)) (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (not (= v_prenex_3 (select (select |#memory_$Pointer$.base| v_prenex_3) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)) (select (select |#memory_$Pointer$.base| v_prenex_3) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| v_prenex_3) 0) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)) v_prenex_3)))))} is VALID [2018-11-14 17:27:11,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {1500#(or (exists ((v_prenex_5 Int) (v_prenex_2 Int) (node_create_~temp~0.offset Int)) (and (not (= v_prenex_5 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4))) (+ v_prenex_2 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ node_create_~temp~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ node_create_~temp~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| v_prenex_5) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_5) 0)) (+ main_~ptr~0.offset 4)))) (not (= v_prenex_5 (select (select |#memory_$Pointer$.base| v_prenex_5) 0))))) (exists ((|main_~#s~0.base| Int) (v_prenex_1 Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4))) (+ v_prenex_1 8))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) |main_~#s~0.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ main_~ptr~0.offset 4)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) main_~ptr~0.offset) 0))) (exists ((v_prenex_3 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4))) (+ v_arrayElimCell_11 8)) (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (not (= v_prenex_3 (select (select |#memory_$Pointer$.base| v_prenex_3) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)) (select (select |#memory_$Pointer$.base| v_prenex_3) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| v_prenex_3) 0) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_3) 0)) (+ main_~ptr~0.offset 4)) v_prenex_3)))))} assume !(~uneq~0 != #t~mem12);havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset + 4, 4);~ptr~0.base, ~ptr~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;~count~0 := 1; {1363#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-14 17:27:11,874 INFO L273 TraceCheckUtils]: 41: Hoare triple {1363#(not (= 0 main_~ptr~0.base))} assume true; {1363#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-14 17:27:11,894 INFO L273 TraceCheckUtils]: 42: Hoare triple {1363#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1344#false} is VALID [2018-11-14 17:27:11,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {1344#false} assume ~count~0 != 1 + ~len~0; {1344#false} is VALID [2018-11-14 17:27:11,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2018-11-14 17:27:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:27:11,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:27:11,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2018-11-14 17:27:11,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 17:27:11,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:11,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:27:18,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 76 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:18,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:27:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:27:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1284, Unknown=25, NotChecked=0, Total=1406 [2018-11-14 17:27:18,138 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 38 states.