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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:56:51,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:51,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:51,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:51,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:51,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:51,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:51,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:51,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:51,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:51,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:51,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:51,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:51,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:51,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:51,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:51,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:51,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:51,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:51,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:51,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:51,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:51,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:51,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:51,407 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:51,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:51,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:51,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:51,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:51,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:51,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:51,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:51,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:51,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:51,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:51,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:51,415 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-23 12:56:51,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:51,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:51,437 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:56:51,438 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:56:51,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:51,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:51,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:51,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:51,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:51,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:51,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:51,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:51,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:56:51,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:56:51,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:56:51,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:51,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:51,442 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:51,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:56:51,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:51,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:51,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:56:51,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:56:51,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:56:51,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:51,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:56:51,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:56:51,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:51,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:56:51,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:56:51,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:56:51,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:51,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:51,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:51,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:51,529 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:51,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:51,595 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ffe13a7/caae370cd1b840bc90c4a5c5c21cf688/FLAG987de5943 [2018-11-23 12:56:52,136 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:52,140 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:52,156 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ffe13a7/caae370cd1b840bc90c4a5c5c21cf688/FLAG987de5943 [2018-11-23 12:56:52,392 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ffe13a7/caae370cd1b840bc90c4a5c5c21cf688 [2018-11-23 12:56:52,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:52,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:52,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:52,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:52,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:52,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:52" (1/1) ... [2018-11-23 12:56:52,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c949a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:52, skipping insertion in model container [2018-11-23 12:56:52,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:52" (1/1) ... [2018-11-23 12:56:52,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:52,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:52,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:52,963 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:53,054 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:53,134 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:53,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53 WrapperNode [2018-11-23 12:56:53,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:53,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:53,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:53,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:53,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:53,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:53,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:53,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:53,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (1/1) ... [2018-11-23 12:56:53,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:53,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:53,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:53,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:53,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (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-23 12:56:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 12:56:53,403 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 12:56:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:56:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:56:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2018-11-23 12:56:53,404 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2018-11-23 12:56:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:56:53,404 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:56:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:56:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:56:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:56:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:56:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:56:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:56:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:56:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:56:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:56:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:56:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:56:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 12:56:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 12:56:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:54,517 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:54,518 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:56:54,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:54 BoogieIcfgContainer [2018-11-23 12:56:54,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:54,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:56:54,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:56:54,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:56:54,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:56:52" (1/3) ... [2018-11-23 12:56:54,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de014e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:54, skipping insertion in model container [2018-11-23 12:56:54,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:53" (2/3) ... [2018-11-23 12:56:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de014e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:54, skipping insertion in model container [2018-11-23 12:56:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:54" (3/3) ... [2018-11-23 12:56:54,527 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:54,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:56:54,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:56:54,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:56:54,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:54,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:56:54,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:56:54,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:56:54,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:54,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:54,600 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:56:54,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:54,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:56:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 12:56:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:56:54,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:54,629 INFO L402 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, 1] [2018-11-23 12:56:54,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:54,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -190176239, now seen corresponding path program 1 times [2018-11-23 12:56:54,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:54,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:54,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 12:56:54,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56#true} is VALID [2018-11-23 12:56:54,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:56:54,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2018-11-23 12:56:54,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret19 := main(); {56#true} is VALID [2018-11-23 12:56:54,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {56#true} is VALID [2018-11-23 12:56:54,941 INFO L256 TraceCheckUtils]: 6: Hoare triple {56#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {56#true} is VALID [2018-11-23 12:56:54,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {56#true} is VALID [2018-11-23 12:56:54,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {56#true} assume !(~len > 0); {56#true} is VALID [2018-11-23 12:56:54,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {56#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {56#true} is VALID [2018-11-23 12:56:54,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:56:54,943 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {56#true} {56#true} #132#return; {56#true} is VALID [2018-11-23 12:56:54,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {56#true} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {56#true} is VALID [2018-11-23 12:56:54,943 INFO L256 TraceCheckUtils]: 13: Hoare triple {56#true} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {56#true} is VALID [2018-11-23 12:56:54,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {56#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {56#true} is VALID [2018-11-23 12:56:54,944 INFO L256 TraceCheckUtils]: 15: Hoare triple {56#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {56#true} is VALID [2018-11-23 12:56:54,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {56#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; {56#true} is VALID [2018-11-23 12:56:54,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {56#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {56#true} is VALID [2018-11-23 12:56:54,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {56#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {56#true} is VALID [2018-11-23 12:56:54,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:56:54,946 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {56#true} {56#true} #144#return; {56#true} is VALID [2018-11-23 12:56:54,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {56#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {56#true} is VALID [2018-11-23 12:56:54,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {56#true} assume !true; {57#false} is VALID [2018-11-23 12:56:54,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {57#false} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {57#false} is VALID [2018-11-23 12:56:54,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {57#false} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {57#false} is VALID [2018-11-23 12:56:54,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-23 12:56:54,962 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {57#false} {56#true} #134#return; {57#false} is VALID [2018-11-23 12:56:54,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {57#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {57#false} is VALID [2018-11-23 12:56:54,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {57#false} assume !true; {57#false} is VALID [2018-11-23 12:56:54,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {57#false} assume ~count~0 != 1 + ~len~0; {57#false} is VALID [2018-11-23 12:56:54,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 12:56:54,969 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-23 12:56:54,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:54,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:56:54,978 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:56:54,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:54,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:56:55,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:55,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:56:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:56:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:55,339 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-23 12:56:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:55,764 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2018-11-23 12:56:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:56:55,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:56:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2018-11-23 12:56:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2018-11-23 12:56:55,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 120 transitions. [2018-11-23 12:56:56,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:56,568 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:56:56,569 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:56:56,573 INFO L631 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-23 12:56:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:56:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:56:56,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:56,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:56:56,622 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:56:56,622 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:56:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:56,627 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 12:56:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 12:56:56,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:56,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:56,629 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:56:56,629 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:56:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:56,634 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 12:56:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 12:56:56,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:56,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:56,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:56,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:56:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 12:56:56,641 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 31 [2018-11-23 12:56:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:56,642 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 12:56:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:56:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 12:56:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:56:56,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:56,644 INFO L402 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, 1] [2018-11-23 12:56:56,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:56,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1550301628, now seen corresponding path program 1 times [2018-11-23 12:56:56,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:56,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:56,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:56,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:56,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:56,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 12:56:56,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {317#true} is VALID [2018-11-23 12:56:56,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 12:56:56,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #140#return; {317#true} is VALID [2018-11-23 12:56:56,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret19 := main(); {317#true} is VALID [2018-11-23 12:56:56,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {317#true} is VALID [2018-11-23 12:56:56,804 INFO L256 TraceCheckUtils]: 6: Hoare triple {317#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {317#true} is VALID [2018-11-23 12:56:56,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {317#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {317#true} is VALID [2018-11-23 12:56:56,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {317#true} assume !(~len > 0); {317#true} is VALID [2018-11-23 12:56:56,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {317#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {317#true} is VALID [2018-11-23 12:56:56,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 12:56:56,806 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {317#true} {317#true} #132#return; {317#true} is VALID [2018-11-23 12:56:56,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {317#true} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {317#true} is VALID [2018-11-23 12:56:56,807 INFO L256 TraceCheckUtils]: 13: Hoare triple {317#true} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {317#true} is VALID [2018-11-23 12:56:56,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {317#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {317#true} is VALID [2018-11-23 12:56:56,808 INFO L256 TraceCheckUtils]: 15: Hoare triple {317#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {317#true} is VALID [2018-11-23 12:56:56,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {317#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; {317#true} is VALID [2018-11-23 12:56:56,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {317#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {317#true} is VALID [2018-11-23 12:56:56,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {317#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {317#true} is VALID [2018-11-23 12:56:56,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 12:56:56,809 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {317#true} {317#true} #144#return; {317#true} is VALID [2018-11-23 12:56:56,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {317#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {319#(and (= dll_insert_~snd_to_last~0.base 0) (= dll_insert_~snd_to_last~0.offset 0))} is VALID [2018-11-23 12:56:56,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {319#(and (= dll_insert_~snd_to_last~0.base 0) (= dll_insert_~snd_to_last~0.offset 0))} assume !(~index > 0); {319#(and (= dll_insert_~snd_to_last~0.base 0) (= dll_insert_~snd_to_last~0.offset 0))} is VALID [2018-11-23 12:56:56,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {319#(and (= dll_insert_~snd_to_last~0.base 0) (= dll_insert_~snd_to_last~0.offset 0))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {318#false} is VALID [2018-11-23 12:56:56,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {318#false} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {318#false} is VALID [2018-11-23 12:56:56,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {318#false} assume true; {318#false} is VALID [2018-11-23 12:56:56,823 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {318#false} {317#true} #134#return; {318#false} is VALID [2018-11-23 12:56:56,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {318#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {318#false} is VALID [2018-11-23 12:56:56,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {318#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {318#false} is VALID [2018-11-23 12:56:56,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {318#false} assume ~count~0 != 1 + ~len~0; {318#false} is VALID [2018-11-23 12:56:56,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 12:56:56,826 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-23 12:56:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:56:56,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:56:56,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:56,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:56:56,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:56,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:56:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:56:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:56,918 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 3 states. [2018-11-23 12:56:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:57,110 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:56:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:56:57,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:56:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 12:56:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 12:56:57,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 12:56:57,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:57,265 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:56:57,265 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:56:57,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:56:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:56:57,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:57,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:56:57,293 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:56:57,294 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:56:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:57,297 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:56:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:56:57,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:57,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:57,298 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:56:57,298 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:56:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:57,302 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:56:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:56:57,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:57,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:57,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:57,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:56:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:56:57,307 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-23 12:56:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:57,307 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:56:57,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:56:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:56:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:56:57,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:57,309 INFO L402 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, 1, 1] [2018-11-23 12:56:57,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:57,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash -387588301, now seen corresponding path program 1 times [2018-11-23 12:56:57,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:57,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2018-11-23 12:56:57,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {533#true} is VALID [2018-11-23 12:56:57,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-23 12:56:57,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #140#return; {533#true} is VALID [2018-11-23 12:56:57,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret19 := main(); {533#true} is VALID [2018-11-23 12:56:57,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {533#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {535#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:57,467 INFO L256 TraceCheckUtils]: 6: Hoare triple {535#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {533#true} is VALID [2018-11-23 12:56:57,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {533#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {536#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:57,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {536#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {537#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:56:57,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {537#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {537#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:56:57,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(<= |dll_create_#in~len| 0)} assume true; {537#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:56:57,475 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {537#(<= |dll_create_#in~len| 0)} {535#(<= 2 main_~len~0)} #132#return; {534#false} is VALID [2018-11-23 12:56:57,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {534#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {534#false} is VALID [2018-11-23 12:56:57,476 INFO L256 TraceCheckUtils]: 13: Hoare triple {534#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {533#true} is VALID [2018-11-23 12:56:57,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {533#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {533#true} is VALID [2018-11-23 12:56:57,476 INFO L256 TraceCheckUtils]: 15: Hoare triple {533#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {533#true} is VALID [2018-11-23 12:56:57,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {533#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; {533#true} is VALID [2018-11-23 12:56:57,477 INFO L273 TraceCheckUtils]: 17: Hoare triple {533#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {533#true} is VALID [2018-11-23 12:56:57,477 INFO L273 TraceCheckUtils]: 18: Hoare triple {533#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {533#true} is VALID [2018-11-23 12:56:57,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-23 12:56:57,478 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {533#true} {533#true} #144#return; {533#true} is VALID [2018-11-23 12:56:57,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {533#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {533#true} is VALID [2018-11-23 12:56:57,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {533#true} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {533#true} is VALID [2018-11-23 12:56:57,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {533#true} assume !(~index > 0); {533#true} is VALID [2018-11-23 12:56:57,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {533#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {533#true} is VALID [2018-11-23 12:56:57,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {533#true} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {533#true} is VALID [2018-11-23 12:56:57,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-23 12:56:57,480 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {533#true} {534#false} #134#return; {534#false} is VALID [2018-11-23 12:56:57,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {534#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {534#false} is VALID [2018-11-23 12:56:57,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {534#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {534#false} is VALID [2018-11-23 12:56:57,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {534#false} assume ~count~0 != 1 + ~len~0; {534#false} is VALID [2018-11-23 12:56:57,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {534#false} assume !false; {534#false} is VALID [2018-11-23 12:56:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:57,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:56:57,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:57,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:57,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:57,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:57,604 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-23 12:56:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:57,985 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 12:56:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:57,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:56:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:56:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:56:57,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 12:56:58,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:58,146 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:56:58,146 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:56:58,147 INFO L631 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-23 12:56:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:56:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 12:56:58,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:58,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 12:56:58,179 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 12:56:58,180 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 12:56:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:58,183 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:56:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 12:56:58,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:58,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:58,185 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 12:56:58,185 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 12:56:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:58,188 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:56:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 12:56:58,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:58,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:58,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:58,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:56:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 12:56:58,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 32 [2018-11-23 12:56:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:58,192 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 12:56:58,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 12:56:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:56:58,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:58,194 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:58,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:58,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1024221899, now seen corresponding path program 1 times [2018-11-23 12:56:58,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:58,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2018-11-23 12:56:58,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {790#true} is VALID [2018-11-23 12:56:58,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2018-11-23 12:56:58,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #140#return; {790#true} is VALID [2018-11-23 12:56:58,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret19 := main(); {790#true} is VALID [2018-11-23 12:56:58,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {790#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {790#true} is VALID [2018-11-23 12:56:58,331 INFO L256 TraceCheckUtils]: 6: Hoare triple {790#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {790#true} is VALID [2018-11-23 12:56:58,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:56:58,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} 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; {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:56:58,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:56:58,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:56:58,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {792#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {791#false} is VALID [2018-11-23 12:56:58,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {791#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; {791#false} is VALID [2018-11-23 12:56:58,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {791#false} assume !(~len > 0); {791#false} is VALID [2018-11-23 12:56:58,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {791#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {791#false} is VALID [2018-11-23 12:56:58,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#false} assume true; {791#false} is VALID [2018-11-23 12:56:58,341 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {791#false} {790#true} #132#return; {791#false} is VALID [2018-11-23 12:56:58,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {791#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {791#false} is VALID [2018-11-23 12:56:58,341 INFO L256 TraceCheckUtils]: 18: Hoare triple {791#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {790#true} is VALID [2018-11-23 12:56:58,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {790#true} is VALID [2018-11-23 12:56:58,342 INFO L256 TraceCheckUtils]: 20: Hoare triple {790#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {790#true} is VALID [2018-11-23 12:56:58,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {790#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; {790#true} is VALID [2018-11-23 12:56:58,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {790#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {790#true} is VALID [2018-11-23 12:56:58,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {790#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {790#true} is VALID [2018-11-23 12:56:58,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {790#true} assume true; {790#true} is VALID [2018-11-23 12:56:58,343 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {790#true} {790#true} #144#return; {790#true} is VALID [2018-11-23 12:56:58,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {790#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {790#true} is VALID [2018-11-23 12:56:58,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {790#true} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {790#true} is VALID [2018-11-23 12:56:58,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {790#true} assume !(~index > 0); {790#true} is VALID [2018-11-23 12:56:58,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {790#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {790#true} is VALID [2018-11-23 12:56:58,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {790#true} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {790#true} is VALID [2018-11-23 12:56:58,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {790#true} assume true; {790#true} is VALID [2018-11-23 12:56:58,345 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {790#true} {791#false} #134#return; {791#false} is VALID [2018-11-23 12:56:58,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {791#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {791#false} is VALID [2018-11-23 12:56:58,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {791#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {791#false} is VALID [2018-11-23 12:56:58,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {791#false} assume ~count~0 != 1 + ~len~0; {791#false} is VALID [2018-11-23 12:56:58,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {791#false} assume !false; {791#false} is VALID [2018-11-23 12:56:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:58,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:58,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:56:58,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:56:58,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:58,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:56:58,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:58,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:56:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:56:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:58,417 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 3 states. [2018-11-23 12:56:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:58,590 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-11-23 12:56:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:56:58,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:56:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:56:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:56:58,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 12:56:58,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:58,749 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:56:58,749 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:56:58,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:56:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 12:56:58,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:58,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 12:56:58,827 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 12:56:58,827 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 12:56:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:58,832 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:56:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:56:58,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:58,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:58,833 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 12:56:58,833 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 12:56:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:58,836 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:56:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:56:58,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:58,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:58,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:58,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:56:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-23 12:56:58,840 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 37 [2018-11-23 12:56:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:58,840 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-23 12:56:58,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:56:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:56:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:56:58,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:58,842 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:58,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:58,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1086261513, now seen corresponding path program 1 times [2018-11-23 12:56:58,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:58,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:59,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1052#true} is VALID [2018-11-23 12:56:59,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1052#true} is VALID [2018-11-23 12:56:59,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-23 12:56:59,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #140#return; {1052#true} is VALID [2018-11-23 12:56:59,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret19 := main(); {1052#true} is VALID [2018-11-23 12:56:59,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {1052#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1054#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:59,127 INFO L256 TraceCheckUtils]: 6: Hoare triple {1054#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1052#true} is VALID [2018-11-23 12:56:59,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {1052#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {1055#(<= |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; {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {1055#(<= |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; {1056#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:56:59,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {1056#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(<= |dll_create_#in~len| 1)} assume true; {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,135 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1057#(<= |dll_create_#in~len| 1)} {1054#(<= 2 main_~len~0)} #132#return; {1053#false} is VALID [2018-11-23 12:56:59,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {1053#false} is VALID [2018-11-23 12:56:59,135 INFO L256 TraceCheckUtils]: 18: Hoare triple {1053#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {1052#true} is VALID [2018-11-23 12:56:59,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {1052#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1052#true} is VALID [2018-11-23 12:56:59,136 INFO L256 TraceCheckUtils]: 20: Hoare triple {1052#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1052#true} is VALID [2018-11-23 12:56:59,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {1052#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; {1052#true} is VALID [2018-11-23 12:56:59,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {1052#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1052#true} is VALID [2018-11-23 12:56:59,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {1052#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1052#true} is VALID [2018-11-23 12:56:59,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-23 12:56:59,138 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1052#true} {1052#true} #144#return; {1052#true} is VALID [2018-11-23 12:56:59,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {1052#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1052#true} is VALID [2018-11-23 12:56:59,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {1052#true} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1052#true} is VALID [2018-11-23 12:56:59,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {1052#true} assume !(~index > 0); {1052#true} is VALID [2018-11-23 12:56:59,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {1052#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1052#true} is VALID [2018-11-23 12:56:59,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {1052#true} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {1052#true} is VALID [2018-11-23 12:56:59,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-23 12:56:59,139 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1052#true} {1053#false} #134#return; {1053#false} is VALID [2018-11-23 12:56:59,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {1053#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {1053#false} is VALID [2018-11-23 12:56:59,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {1053#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1053#false} is VALID [2018-11-23 12:56:59,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {1053#false} assume ~count~0 != 1 + ~len~0; {1053#false} is VALID [2018-11-23 12:56:59,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2018-11-23 12:56:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:59,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:59,143 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-23 12:56:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:59,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:59,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1052#true} is VALID [2018-11-23 12:56:59,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {1052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1052#true} is VALID [2018-11-23 12:56:59,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-23 12:56:59,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #140#return; {1052#true} is VALID [2018-11-23 12:56:59,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret19 := main(); {1052#true} is VALID [2018-11-23 12:56:59,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {1052#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1054#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:59,647 INFO L256 TraceCheckUtils]: 6: Hoare triple {1054#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1052#true} is VALID [2018-11-23 12:56:59,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {1052#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {1055#(<= |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; {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1055#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:56:59,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {1055#(<= |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; {1056#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:56:59,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {1056#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(<= |dll_create_#in~len| 1)} assume true; {1057#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:56:59,659 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1057#(<= |dll_create_#in~len| 1)} {1054#(<= 2 main_~len~0)} #132#return; {1053#false} is VALID [2018-11-23 12:56:59,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {1053#false} is VALID [2018-11-23 12:56:59,659 INFO L256 TraceCheckUtils]: 18: Hoare triple {1053#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {1053#false} is VALID [2018-11-23 12:56:59,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {1053#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1053#false} is VALID [2018-11-23 12:56:59,660 INFO L256 TraceCheckUtils]: 20: Hoare triple {1053#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1053#false} is VALID [2018-11-23 12:56:59,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {1053#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; {1053#false} is VALID [2018-11-23 12:56:59,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {1053#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1053#false} is VALID [2018-11-23 12:56:59,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {1053#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1053#false} is VALID [2018-11-23 12:56:59,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-23 12:56:59,662 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1053#false} {1053#false} #144#return; {1053#false} is VALID [2018-11-23 12:56:59,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {1053#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1053#false} is VALID [2018-11-23 12:56:59,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {1053#false} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1053#false} is VALID [2018-11-23 12:56:59,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {1053#false} assume !(~index > 0); {1053#false} is VALID [2018-11-23 12:56:59,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {1053#false} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1053#false} is VALID [2018-11-23 12:56:59,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {1053#false} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {1053#false} is VALID [2018-11-23 12:56:59,663 INFO L273 TraceCheckUtils]: 31: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-23 12:56:59,664 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1053#false} {1053#false} #134#return; {1053#false} is VALID [2018-11-23 12:56:59,664 INFO L273 TraceCheckUtils]: 33: Hoare triple {1053#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {1053#false} is VALID [2018-11-23 12:56:59,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {1053#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1053#false} is VALID [2018-11-23 12:56:59,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {1053#false} assume ~count~0 != 1 + ~len~0; {1053#false} is VALID [2018-11-23 12:56:59,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2018-11-23 12:56:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:59,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:56:59,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:56:59,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:59,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:56:59,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:59,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:56:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:56:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:56:59,844 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2018-11-23 12:57:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:00,246 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-23 12:57:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:57:00,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:57:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 12:57:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 12:57:00,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-23 12:57:00,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:00,408 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:57:00,408 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:57:00,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:57:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:57:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-23 12:57:00,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:00,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-23 12:57:00,439 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-23 12:57:00,440 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-23 12:57:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:00,444 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 12:57:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 12:57:00,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:00,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:00,445 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-23 12:57:00,445 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-23 12:57:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:00,447 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 12:57:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 12:57:00,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:00,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:00,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:00,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:57:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 12:57:00,451 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 37 [2018-11-23 12:57:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 12:57:00,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:57:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:57:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:57:00,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:00,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:00,454 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:00,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1219620533, now seen corresponding path program 1 times [2018-11-23 12:57:00,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:00,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:02,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {1440#true} call ULTIMATE.init(); {1440#true} is VALID [2018-11-23 12:57:02,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {1440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1440#true} is VALID [2018-11-23 12:57:02,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {1440#true} assume true; {1440#true} is VALID [2018-11-23 12:57:02,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1440#true} {1440#true} #140#return; {1440#true} is VALID [2018-11-23 12:57:02,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {1440#true} call #t~ret19 := main(); {1440#true} is VALID [2018-11-23 12:57:02,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {1440#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1442#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:57:02,779 INFO L256 TraceCheckUtils]: 6: Hoare triple {1442#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1443#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:57:02,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {1443#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1443#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:57:02,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {1443#(= |#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; {1444#(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-23 12:57:02,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {1444#(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); {1444#(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-23 12:57:02,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {1444#(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, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1444#(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-23 12:57:02,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {1444#(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); {1444#(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-23 12:57:02,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(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; {1444#(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-23 12:57:02,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(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; {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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-23 12:57:02,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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); {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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-23 12:57:02,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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-23 12:57:02,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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, 8 + ~head~0.offset, 4); {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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-23 12:57:02,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {1445#(and (not (= 0 dll_create_~new_head~0.base)) (= 0 (select |old(#valid)| 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|)))) (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; {1446#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (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-23 12:57:02,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (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); {1446#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (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-23 12:57:02,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (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; {1447#(and (not (= 0 |dll_create_#res.base|)) (= 0 (select |old(#valid)| |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|)))) (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-23 12:57:02,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {1447#(and (not (= 0 |dll_create_#res.base|)) (= 0 (select |old(#valid)| |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|)))) (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; {1447#(and (not (= 0 |dll_create_#res.base|)) (= 0 (select |old(#valid)| |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|)))) (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-23 12:57:02,824 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1447#(and (not (= 0 |dll_create_#res.base|)) (= 0 (select |old(#valid)| |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|)))) (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|)))))} {1442#(= (select |#valid| |main_~#s~0.base|) 1)} #132#return; {1448#(and (not (= 0 |main_#t~ret13.base|)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:57:02,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {1448#(and (not (= 0 |main_#t~ret13.base|)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {1449#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:57:02,827 INFO L256 TraceCheckUtils]: 23: Hoare triple {1449#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {1450#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:57:02,828 INFO L273 TraceCheckUtils]: 24: Hoare triple {1450#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1451#(and (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_insert_~head.base) (select |#memory_$Pointer$.base| dll_insert_~head.base)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= dll_insert_~head.base |dll_insert_#in~head.base|))} is VALID [2018-11-23 12:57:02,829 INFO L256 TraceCheckUtils]: 25: Hoare triple {1451#(and (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_insert_~head.base) (select |#memory_$Pointer$.base| dll_insert_~head.base)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= dll_insert_~head.base |dll_insert_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1450#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:57:02,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#(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; {1452#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-23 12:57:02,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {1452#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1452#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-23 12:57:02,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {1452#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1453#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#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|)))) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-23 12:57:02,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {1453#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#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|)))) (not (= 0 |node_create_#res.base|)))} assume true; {1453#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#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|)))) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-23 12:57:02,839 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1453#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#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|)))) (not (= 0 |node_create_#res.base|)))} {1451#(and (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_insert_~head.base) (select |#memory_$Pointer$.base| dll_insert_~head.base)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= dll_insert_~head.base |dll_insert_#in~head.base|))} #144#return; {1454#(and (or (= 0 (select |old(#valid)| dll_insert_~head.base)) (= (select |old(#memory_$Pointer$.base)| dll_insert_~head.base) (select |#memory_$Pointer$.base| dll_insert_~head.base))) (= 0 (select |old(#valid)| |dll_insert_#t~ret6.base|)) (not (= 0 |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= dll_insert_~head.base |dll_insert_#in~head.base|))} is VALID [2018-11-23 12:57:02,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {1454#(and (or (= 0 (select |old(#valid)| dll_insert_~head.base)) (= (select |old(#memory_$Pointer$.base)| dll_insert_~head.base) (select |#memory_$Pointer$.base| dll_insert_~head.base))) (= 0 (select |old(#valid)| |dll_insert_#t~ret6.base|)) (not (= 0 |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= dll_insert_~head.base |dll_insert_#in~head.base|))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1455#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 dll_insert_~new_node~0.base)) (not (= dll_insert_~new_node~0.base |dll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|))))} is VALID [2018-11-23 12:57:02,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1455#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 dll_insert_~new_node~0.base)) (not (= dll_insert_~new_node~0.base |dll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|))))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1456#(or (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= 0 dll_insert_~new_node~0.base)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= dll_insert_~last~0.base |dll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} is VALID [2018-11-23 12:57:02,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {1456#(or (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= 0 dll_insert_~new_node~0.base)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= dll_insert_~last~0.base |dll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} assume !(~index > 0); {1456#(or (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= 0 dll_insert_~new_node~0.base)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= dll_insert_~last~0.base |dll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} is VALID [2018-11-23 12:57:02,847 INFO L273 TraceCheckUtils]: 34: Hoare triple {1456#(or (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= 0 dll_insert_~new_node~0.base)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (= (select (store (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) dll_insert_~snd_to_last~0.base) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (not (= dll_insert_~last~0.base |dll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1457#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 dll_insert_~new_node~0.base)) (= (select |#memory_$Pointer$.base| dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| dll_insert_~last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~last~0.base) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} is VALID [2018-11-23 12:57:02,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {1457#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 dll_insert_~new_node~0.base)) (= (select |#memory_$Pointer$.base| dll_insert_~last~0.base) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (= dll_insert_~last~0.base |dll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| dll_insert_~last~0.base (store (select |#memory_$Pointer$.base| dll_insert_~last~0.base) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base)) |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|))} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {1458#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|))))) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (store (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)))))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)))} is VALID [2018-11-23 12:57:02,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {1458#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|))))) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (store (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)))))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)))} assume true; {1458#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|))))) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (store (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)))))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)))} is VALID [2018-11-23 12:57:02,854 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1458#(or (= 0 (select |old(#valid)| |dll_insert_#in~head.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|))))) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (store (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|)))))) (= (select (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) |dll_insert_#in~head.base|) (= (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |dll_insert_#in~head.base|)))} {1449#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #134#return; {1459#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:57:02,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {1459#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {1460#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:57:02,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {1460#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1441#false} is VALID [2018-11-23 12:57:02,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {1441#false} assume ~count~0 != 1 + ~len~0; {1441#false} is VALID [2018-11-23 12:57:02,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2018-11-23 12:57:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:02,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:57:02,894 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-23 12:57:02,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:02,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:57:03,049 INFO L478 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-23 12:57:03,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:57:03,064 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:03,064 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= |#valid| (store |v_#valid_27| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0)) [2018-11-23 12:57:03,064 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:57:03,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 12:57:03,732 INFO L478 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 15 treesize of output 18 [2018-11-23 12:57:03,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:57:03,743 INFO L478 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 18 treesize of output 27 [2018-11-23 12:57:03,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:48, output treesize:48 [2018-11-23 12:57:03,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:57:03,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-23 12:57:03,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:57:03,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:03,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:57:03,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:72 [2018-11-23 12:57:03,983 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:03,984 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_40|, dll_create_~head~0.offset]. (let ((.cse0 (select |v_#memory_$Pointer$.base_40| dll_create_~new_head~0.base))) (let ((.cse1 (select .cse0 (+ dll_create_~new_head~0.offset 4)))) (let ((.cse2 (store |old(#valid)| .cse1 1))) (and (= (select .cse0 (+ dll_create_~new_head~0.offset 8)) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_40| .cse1 (store (select |v_#memory_$Pointer$.base_40| .cse1) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base))) (= 0 (select .cse2 dll_create_~new_head~0.base)) (not (= dll_create_~new_head~0.base 0)) (= 0 dll_create_~new_head~0.offset) (= |#valid| (store .cse2 dll_create_~new_head~0.base 1)) (= 0 (select |old(#valid)| .cse1)))))) [2018-11-23 12:57:03,984 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_create_~head~0.offset]. (let ((.cse2 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base))) (let ((.cse0 (select .cse2 (+ dll_create_~new_head~0.offset 4)))) (let ((.cse1 (store |old(#valid)| .cse0 1))) (and (= (select |old(#valid)| .cse0) 0) (not (= dll_create_~new_head~0.base 0)) (= (select (select |#memory_$Pointer$.base| .cse0) (+ dll_create_~head~0.offset 8)) dll_create_~new_head~0.base) (= |#valid| (store .cse1 dll_create_~new_head~0.base 1)) (= (select .cse2 (+ dll_create_~new_head~0.offset 8)) 0) (= 0 (select .cse1 dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset))))) [2018-11-23 12:57:04,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:57:04,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:57:04,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:57:04,587 INFO L478 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 37 treesize of output 60 [2018-11-23 12:57:04,634 INFO L478 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 36 treesize of output 52 [2018-11-23 12:57:04,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:57:04,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:04,693 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-23 12:57:04,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:80 [2018-11-23 12:57:04,697 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:04,698 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_6|, v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse2 (select .cse1 (+ |main_#t~ret13.offset| 4)))) (let ((.cse0 (store |v_old(#valid)_AFTER_CALL_6| .cse2 1))) (and (not (= 0 |main_#t~ret13.base|)) (= 1 (select |v_old(#valid)_AFTER_CALL_6| |main_~#s~0.base|)) (= 0 (select .cse0 |main_#t~ret13.base|)) (= |#valid| (store .cse0 |main_#t~ret13.base| 1)) (= 0 (select .cse1 (+ |main_#t~ret13.offset| 8))) (= |main_~#s~0.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) (+ v_subst_1 8)) |main_#t~ret13.base|) (= 0 (select |v_old(#valid)_AFTER_CALL_6| .cse2)) (= |main_#t~ret13.offset| 0))))) [2018-11-23 12:57:04,698 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse0 (select .cse1 (+ |main_#t~ret13.offset| 4)))) (and (not (= 0 |main_#t~ret13.base|)) (not (= |main_~#s~0.base| .cse0)) (= (select |#valid| |main_#t~ret13.base|) 1) (= 0 (select .cse1 (+ |main_#t~ret13.offset| 8))) (= |main_~#s~0.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) (+ v_subst_1 8)) |main_#t~ret13.base|) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= .cse0 |main_#t~ret13.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= |main_#t~ret13.offset| 0) (= 1 (select |#valid| .cse0))))) [2018-11-23 12:57:09,501 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 12:57:13,777 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 12:57:13,807 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-23 12:57:13,812 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-23 12:57:13,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-23 12:57:13,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:63 [2018-11-23 12:57:15,849 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:15,849 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, node_create_~temp~0.offset]. (let ((.cse0 (+ node_create_~temp~0.offset 4)) (.cse1 (+ node_create_~temp~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))) [2018-11-23 12:57:15,849 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_2]. (let ((.cse0 (+ node_create_~temp~0.offset 4)) (.cse1 (+ node_create_~temp~0.offset 8))) (and (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))) [2018-11-23 12:57:16,175 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-23 12:57:16,201 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-23 12:57:16,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 12:57:16,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:168, output treesize:341 [2018-11-23 12:57:17,441 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:17,442 WARN L384 uantifierElimination]: Input elimination task: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_2, |v_#memory_$Pointer$.base_42|, dll_insert_~new_node~0.offset]. (let ((.cse0 (+ node_create_~temp~0.offset 4)) (.cse1 (+ node_create_~temp~0.offset 8)) (.cse3 (select (select |v_#memory_$Pointer$.base_42| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|))) (let ((.cse4 (select |v_#memory_$Pointer$.base_42| .cse3)) (.cse5 (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (and (= |v_#memory_$Pointer$.base_42| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) .cse0 0) .cse1 0) node_create_~temp~0.offset (select (select |v_#memory_$Pointer$.base_42| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (let ((.cse2 (store |v_#memory_$Pointer$.base_42| .cse3 (store .cse4 .cse5 dll_insert_~new_node~0.base)))) (store .cse2 dll_insert_~new_node~0.base (store (store (select .cse2 dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) .cse3) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0) (= (select .cse4 .cse5) dll_insert_~last~0.base)))) [2018-11-23 12:57:17,442 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_4, v_DerPreprocessor_2, dll_insert_~new_node~0.offset]. (let ((.cse5 (+ node_create_~temp~0.offset 4)) (.cse6 (+ node_create_~temp~0.offset 8))) (let ((.cse2 (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) .cse5 0) .cse6 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse1 (select (select .cse2 |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|))) (let ((.cse3 (select .cse2 .cse1)) (.cse4 (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) .cse5 0) .cse6 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (and (= |#memory_$Pointer$.base| (let ((.cse0 (store .cse2 .cse1 (store .cse3 .cse4 dll_insert_~new_node~0.base)))) (store .cse0 dll_insert_~new_node~0.base (store (store (select .cse0 dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) .cse1) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base)))) (= (select .cse3 .cse4) dll_insert_~last~0.base) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0)))))) [2018-11-23 12:58:08,696 WARN L180 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 174 DAG size of output: 72 [2018-11-23 12:58:08,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:08,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:08,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:08,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:08,753 INFO L478 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 33 treesize of output 61 [2018-11-23 12:58:08,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:08,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 401 [2018-11-23 12:58:08,934 INFO L478 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 401 treesize of output 383 [2018-11-23 12:58:08,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:08,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:09,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:58:09,282 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-23 12:58:09,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 240 [2018-11-23 12:58:09,297 INFO L478 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 18 treesize of output 21 [2018-11-23 12:58:09,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,309 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-11-23 12:58:09,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 12:58:09,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:09,356 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:09,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:09,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 191 [2018-11-23 12:58:09,691 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-23 12:58:09,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,721 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:58:09,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2018-11-23 12:58:09,737 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:58:09,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 134 [2018-11-23 12:58:09,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:09,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 39 treesize of output 83 [2018-11-23 12:58:10,007 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:58:10,008 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:10,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 78 [2018-11-23 12:58:10,155 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:10,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:58:10,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,596 INFO L303 Elim1Store]: Index analysis took 155 ms [2018-11-23 12:58:10,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 82 [2018-11-23 12:58:10,603 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:10,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 110 [2018-11-23 12:58:10,774 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:10,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:10,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 124 [2018-11-23 12:58:10,935 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,104 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 12:58:11,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 158 [2018-11-23 12:58:11,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 12:58:11,368 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,449 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 149 [2018-11-23 12:58:11,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 12:58:11,529 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,609 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 158 [2018-11-23 12:58:11,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 12:58:11,814 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,906 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 149 [2018-11-23 12:58:11,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 12:58:11,991 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:12,066 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:12,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:12,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 160 [2018-11-23 12:58:12,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 12:58:12,332 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:12,419 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:13,031 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 12:58:13,518 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 12:58:14,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 12:58:14,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 27 dim-0 vars, and 10 xjuncts. [2018-11-23 12:58:14,704 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 10 variables, input treesize:926, output treesize:2302 [2018-11-23 12:58:16,710 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:16,711 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_6|, dll_insert_~new_node~0.base, node_create_~temp~0.offset, v_DerPreprocessor_4, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, v_DerPreprocessor_2, dll_insert_~new_node~0.offset, dll_insert_~last~0.offset, |v_#valid_BEFORE_CALL_6|, v_subst_1]. (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse11 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse9))) (let ((.cse10 (select .cse11 4))) (and (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) 1) (= |#memory_$Pointer$.base| (let ((.cse7 (+ node_create_~temp~0.offset 4)) (.cse8 (+ node_create_~temp~0.offset 8))) (let ((.cse4 (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| dll_insert_~new_node~0.base (store (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| dll_insert_~new_node~0.base) .cse7 0) .cse8 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse3 (select (select .cse4 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse6 (+ (select (select (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| dll_insert_~new_node~0.base (store (store (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| dll_insert_~new_node~0.base) .cse7 0) .cse8 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (let ((.cse1 (select .cse5 .cse6))) (let ((.cse0 (let ((.cse2 (store .cse4 .cse3 (store .cse5 .cse6 dll_insert_~new_node~0.base)))) (store .cse2 dll_insert_~new_node~0.base (store (store (select .cse2 dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) .cse3) (+ dll_insert_~new_node~0.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base))))))))) (= .cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse10) (+ v_subst_1 8))) (= (select .cse11 8) 0) (not (= |main_~#s~0.base| .cse10)) (not (= .cse9 |main_~#s~0.base|)) (not (= .cse9 .cse10)) (not (= .cse9 0)) (= 0 (select |v_#valid_BEFORE_CALL_6| dll_insert_~new_node~0.base)) (= 1 (select |v_#valid_BEFORE_CALL_6| .cse9)) (= 1 (select |v_#valid_BEFORE_CALL_6| .cse10)) (= |main_~#s~0.offset| 0) (= 0 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|)))))) [2018-11-23 12:58:16,711 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_insert_~new_node~0.offset, v_prenex_18, v_prenex_17, v_prenex_19, v_prenex_15, v_prenex_16, v_prenex_14, node_create_~temp~0.offset, v_subst_1, v_prenex_28, v_prenex_29, v_prenex_30, v_prenex_20, v_prenex_21, v_prenex_25, v_prenex_27, v_prenex_26, v_prenex_8, v_prenex_9, v_prenex_12, dll_insert_~last~0.offset, v_prenex_13, v_prenex_10, v_prenex_11, v_prenex_22, v_prenex_24, v_prenex_23]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse24 (select |#memory_$Pointer$.base| .cse0))) (let ((.cse10 (select .cse24 (+ |main_~#s~0.offset| 4)))) (let ((.cse2 (not (= .cse0 0))) (.cse3 (not (= .cse0 .cse10))) (.cse4 (not (= |main_~#s~0.base| .cse10))) (.cse6 (= (select .cse24 8) 0)) (.cse7 (not (= .cse0 |main_~#s~0.base|))) (.cse9 (= |main_~#s~0.offset| 0)) (.cse1 (select |#memory_$Pointer$.base| .cse10))) (or (let ((.cse8 (select .cse1 (+ v_prenex_15 8)))) (let ((.cse5 (select |#memory_$Pointer$.base| .cse8))) (and (= .cse0 (select .cse1 (+ v_prenex_15 12))) .cse2 .cse3 .cse4 (= .cse0 (select .cse5 (+ v_prenex_16 8))) .cse6 .cse7 (not (= .cse0 .cse8)) .cse9 (not (= .cse10 .cse8)) (= 0 (select .cse1 (+ v_prenex_15 4))) (not (= |main_~#s~0.base| .cse8)) (= (select .cse5 (+ v_prenex_14 8)) .cse10)))) (let ((.cse11 (select .cse1 node_create_~temp~0.offset))) (and (= (select (select |#memory_$Pointer$.base| .cse11) (+ v_subst_1 8)) .cse10) .cse2 .cse3 .cse6 (= 0 (select .cse1 (+ node_create_~temp~0.offset 8))) .cse7 .cse9 (not (= |main_~#s~0.base| .cse11)) (not (= .cse11 .cse10)) .cse4 (= .cse0 (select .cse1 (+ node_create_~temp~0.offset 4))) (not (= .cse0 .cse11)))) (let ((.cse12 (select .cse1 (+ v_prenex_28 4)))) (let ((.cse13 (select |#memory_$Pointer$.base| .cse12))) (and (not (= .cse10 .cse12)) (= (select .cse13 (+ v_prenex_29 8)) .cse0) (= (select .cse13 (+ v_prenex_30 8)) .cse10) .cse3 .cse2 (= .cse0 (select .cse1 (+ v_prenex_28 8))) (not (= |main_~#s~0.base| .cse12)) .cse6 .cse7 .cse9 (not (= .cse0 .cse12)) .cse4))) (let ((.cse14 (select .cse1 (+ v_prenex_20 8)))) (and (= .cse0 (select .cse1 (+ v_prenex_20 12))) .cse2 .cse3 .cse6 .cse7 (not (= .cse0 .cse14)) .cse9 (not (= .cse10 .cse14)) (= 0 (select .cse1 (+ v_prenex_20 4))) (not (= |main_~#s~0.base| .cse14)) .cse4 (= (select (select |#memory_$Pointer$.base| .cse14) (+ v_prenex_21 8)) .cse10))) (let ((.cse16 (select .cse1 v_prenex_25))) (let ((.cse15 (select |#memory_$Pointer$.base| .cse16))) (and (= (select .cse15 (+ v_prenex_27 8)) .cse10) .cse2 .cse3 (= 0 (select .cse1 (+ v_prenex_25 8))) .cse4 (= .cse0 (select .cse1 (+ v_prenex_25 4))) (not (= .cse0 .cse16)) .cse6 .cse7 .cse9 (= .cse0 (select .cse15 (+ v_prenex_26 8))) (not (= |main_~#s~0.base| .cse16)) (not (= .cse16 .cse10))))) (let ((.cse17 (select .cse1 (+ v_prenex_8 4)))) (and (not (= .cse10 .cse17)) .cse2 .cse3 (= .cse0 (select .cse1 (+ v_prenex_8 8))) (not (= |main_~#s~0.base| .cse17)) .cse6 .cse7 .cse9 (not (= .cse0 .cse17)) .cse4 (= (select (select |#memory_$Pointer$.base| .cse17) (+ v_prenex_9 8)) .cse10))) (let ((.cse19 (select .cse1 (+ v_prenex_12 (- 4))))) (let ((.cse18 (select |#memory_$Pointer$.base| .cse19))) (and (= .cse10 (select .cse18 (+ dll_insert_~last~0.offset 8))) .cse2 .cse3 (not (= .cse10 .cse19)) (= 0 (select .cse1 (+ v_prenex_12 8))) (not (= .cse0 .cse19)) .cse4 (not (= |main_~#s~0.base| .cse19)) (= .cse0 (select .cse18 (+ v_prenex_13 8))) .cse6 .cse7 .cse9 (= 0 (select .cse1 (+ v_prenex_12 4))) (= .cse0 (select .cse1 v_prenex_12))))) (let ((.cse21 (select .cse1 (+ dll_insert_~new_node~0.offset 4)))) (let ((.cse20 (select |#memory_$Pointer$.base| .cse21))) (and .cse2 .cse3 (= 0 (select .cse1 (+ v_prenex_17 8))) (= .cse0 (select .cse20 (+ v_prenex_18 8))) .cse4 (= .cse0 (select .cse1 (+ dll_insert_~new_node~0.offset 8))) (not (= .cse21 |main_~#s~0.base|)) (not (= .cse21 .cse10)) .cse6 .cse7 .cse9 (= 0 (select .cse1 (+ v_prenex_17 4))) (= (select .cse20 (+ v_prenex_19 8)) .cse10) (not (= .cse21 .cse0))))) (let ((.cse22 (select .cse1 (+ v_prenex_10 (- 4))))) (and .cse2 .cse3 (not (= .cse10 .cse22)) (= 0 (select .cse1 (+ v_prenex_10 8))) (not (= .cse0 .cse22)) .cse4 (not (= |main_~#s~0.base| .cse22)) .cse6 .cse7 .cse9 (= 0 (select .cse1 (+ v_prenex_10 4))) (= (select (select |#memory_$Pointer$.base| .cse22) (+ v_prenex_11 8)) .cse10) (= .cse0 (select .cse1 v_prenex_10)))) (let ((.cse23 (select .cse1 (+ v_prenex_22 4)))) (and .cse2 .cse3 (= 0 (select .cse1 (+ v_prenex_23 8))) .cse4 (= .cse0 (select .cse1 (+ v_prenex_22 8))) (not (= .cse23 |main_~#s~0.base|)) (not (= .cse23 .cse10)) .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| .cse23) (+ v_prenex_24 8)) .cse10) .cse9 (= 0 (select .cse1 (+ v_prenex_23 4))) (not (= .cse23 .cse0))))))))) [2018-11-23 12:58:45,494 WARN L180 SmtUtils]: Spent 28.27 s on a formula simplification. DAG size of input: 284 DAG size of output: 66 [2018-11-23 12:58:45,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 95 [2018-11-23 12:58:45,635 INFO L478 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-23 12:58:45,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2018-11-23 12:58:45,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-23 12:58:45,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,719 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 12:58:45,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 94 [2018-11-23 12:58:45,813 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-11-23 12:58:45,815 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:45,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-11-23 12:58:45,857 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,879 INFO L478 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-23 12:58:45,883 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,896 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 12:58:45,905 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:45,923 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:372, output treesize:4 [2018-11-23 12:58:45,929 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:45,930 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, v_prenex_8, v_prenex_9, v_prenex_31, v_prenex_32, node_create_~temp~0.offset, v_subst_1]. (or (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse2 4))) (let ((.cse4 (select |#memory_$Pointer$.base| .cse3))) (let ((.cse0 (select .cse4 (+ v_prenex_8 4)))) (and (not (= .cse0 .cse1)) (= 0 (select .cse2 8)) (= .cse1 main_~ptr~0.base) (not (= |main_~#s~0.base| .cse3)) (not (= .cse0 .cse3)) (not (= .cse1 .cse3)) (not (= .cse0 |main_~#s~0.base|)) (= .cse3 (select (select |#memory_$Pointer$.base| .cse0) (+ v_prenex_9 8))) (not (= |main_~#s~0.base| .cse1)) (= (select .cse4 (+ v_prenex_8 8)) .cse1) (not (= .cse1 0)))))))) (let ((.cse7 (select (select v_prenex_31 v_prenex_32) 0))) (let ((.cse9 (select v_prenex_31 .cse7))) (let ((.cse6 (select .cse9 4))) (let ((.cse8 (select v_prenex_31 .cse6))) (let ((.cse5 (select .cse8 node_create_~temp~0.offset))) (and (not (= .cse5 .cse6)) (= .cse7 main_~ptr~0.base) (= (select .cse8 (+ node_create_~temp~0.offset 4)) .cse7) (not (= .cse7 .cse6)) (not (= v_prenex_32 .cse5)) (= 0 (select .cse9 8)) (= (select (select v_prenex_31 .cse5) (+ v_subst_1 8)) .cse6) (not (= .cse7 .cse5)) (= 0 (select .cse8 (+ node_create_~temp~0.offset 8))) (not (= v_prenex_32 .cse6)) (not (= .cse7 0)) (not (= v_prenex_32 .cse7))))))))) [2018-11-23 12:58:45,930 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= 0 main_~ptr~0.base)) [2018-11-23 12:58:45,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1440#true} call ULTIMATE.init(); {1440#true} is VALID [2018-11-23 12:58:45,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {1440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1440#true} is VALID [2018-11-23 12:58:45,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {1440#true} assume true; {1440#true} is VALID [2018-11-23 12:58:45,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1440#true} {1440#true} #140#return; {1440#true} is VALID [2018-11-23 12:58:45,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {1440#true} call #t~ret19 := main(); {1440#true} is VALID [2018-11-23 12:58:45,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {1440#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1479#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:58:45,934 INFO L256 TraceCheckUtils]: 6: Hoare triple {1479#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1443#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:58:45,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {1443#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1443#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:58:45,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {1443#(= |#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; {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:45,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:45,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:45,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:45,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1489#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.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; {1502#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0))} is VALID [2018-11-23 12:58:45,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {1502#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0))} 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; {1506#(and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0))} is VALID [2018-11-23 12:58:45,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {1506#(and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1510#(and (not (= dll_create_~new_head~0.base 0)) (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0))} is VALID [2018-11-23 12:58:45,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {1510#(and (not (= dll_create_~new_head~0.base 0)) (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1514#(and (not (= dll_create_~new_head~0.base 0)) (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8)) 0) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (= (select |old(#valid)| dll_create_~head~0.base) 0))} is VALID [2018-11-23 12:58:45,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {1514#(and (not (= dll_create_~new_head~0.base 0)) (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8)) 0) (= 0 dll_create_~new_head~0.offset) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (= (select |old(#valid)| dll_create_~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, 8 + ~head~0.offset, 4); {1518#(and (exists ((dll_create_~head~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (+ dll_create_~head~0.offset 8)) dll_create_~new_head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (not (= dll_create_~new_head~0.base 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 1) dll_create_~new_head~0.base 1)) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8)) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 1) dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset))} is VALID [2018-11-23 12:58:45,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {1518#(and (exists ((dll_create_~head~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (+ dll_create_~head~0.offset 8)) dll_create_~new_head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (not (= dll_create_~new_head~0.base 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 1) dll_create_~new_head~0.base 1)) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8)) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 1) dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1522#(and (= (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base 1) |#valid|) (not (= 0 dll_create_~head~0.base)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (+ v_subst_1 8)) dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)))) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base)))} is VALID [2018-11-23 12:58:45,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {1522#(and (= (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base 1) |#valid|) (not (= 0 dll_create_~head~0.base)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (+ v_subst_1 8)) dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)))) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base)))} assume !(~len > 0); {1522#(and (= (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base 1) |#valid|) (not (= 0 dll_create_~head~0.base)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (+ v_subst_1 8)) dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)))) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base)))} is VALID [2018-11-23 12:58:45,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1522#(and (= (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base 1) |#valid|) (not (= 0 dll_create_~head~0.base)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (+ v_subst_1 8)) dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)))) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) 1) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1529#(and (= |dll_create_#res.offset| 0) (exists ((v_subst_1 Int)) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) (+ v_subst_1 8)))) (not (= |dll_create_#res.base| 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0))} is VALID [2018-11-23 12:58:45,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {1529#(and (= |dll_create_#res.offset| 0) (exists ((v_subst_1 Int)) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) (+ v_subst_1 8)))) (not (= |dll_create_#res.base| 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0))} assume true; {1529#(and (= |dll_create_#res.offset| 0) (exists ((v_subst_1 Int)) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) (+ v_subst_1 8)))) (not (= |dll_create_#res.base| 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0))} is VALID [2018-11-23 12:58:45,969 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1529#(and (= |dll_create_#res.offset| 0) (exists ((v_subst_1 Int)) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) (+ v_subst_1 8)))) (not (= |dll_create_#res.base| 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 0) (= 0 (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) 1) |dll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0))} {1479#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #132#return; {1536#(and (not (= 0 |main_#t~ret13.base|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)))) (= (select |#valid| |main_#t~ret13.base|) 1) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4))) (+ v_subst_1 8)) |main_#t~ret13.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 8))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)) |main_#t~ret13.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= |main_#t~ret13.offset| 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)))))} is VALID [2018-11-23 12:58:45,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {1536#(and (not (= 0 |main_#t~ret13.base|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)))) (= (select |#valid| |main_#t~ret13.base|) 1) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4))) (+ v_subst_1 8)) |main_#t~ret13.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 8))) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)) |main_#t~ret13.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= |main_#t~ret13.offset| 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (+ |main_#t~ret13.offset| 4)))))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset; {1540#(and (= 1 (select |#valid| (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) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) (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|)) 8) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= (select |#valid| |main_~#s~0.base|) 1) (exists ((v_subst_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|)) 4)) (+ v_subst_1 8)))))} is VALID [2018-11-23 12:58:45,973 INFO L256 TraceCheckUtils]: 23: Hoare triple {1540#(and (= 1 (select |#valid| (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) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) (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|)) 8) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= (select |#valid| |main_~#s~0.base|) 1) (exists ((v_subst_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|)) 4)) (+ v_subst_1 8)))))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {1544#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:58:45,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {1544#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1548#(and (= |#valid| |old(#valid)|) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:58:45,975 INFO L256 TraceCheckUtils]: 25: Hoare triple {1548#(and (= |#valid| |old(#valid)|) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1544#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:58:45,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {1544#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~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; {1555#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:58:45,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {1555#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1555#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:58:45,988 INFO L273 TraceCheckUtils]: 28: Hoare triple {1555#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1562#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (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) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))))))} is VALID [2018-11-23 12:58:45,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {1562#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (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) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))))))} assume true; {1562#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (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) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))))))} is VALID [2018-11-23 12:58:45,994 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1562#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (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) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))))))} {1548#(and (= |#valid| |old(#valid)|) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #144#return; {1569#(and (= (select |old(#valid)| |dll_insert_#t~ret6.base|) 0) (= |dll_insert_#in~head.base| dll_insert_~head.base) (exists ((node_create_~temp~0.offset Int)) (and (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |dll_insert_#t~ret6.base|) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |dll_insert_#t~ret6.base|) node_create_~temp~0.offset)))))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-23 12:58:45,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {1569#(and (= (select |old(#valid)| |dll_insert_#t~ret6.base|) 0) (= |dll_insert_#in~head.base| dll_insert_~head.base) (exists ((node_create_~temp~0.offset Int)) (and (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |dll_insert_#t~ret6.base|) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |dll_insert_#t~ret6.base|) node_create_~temp~0.offset)))))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1573#(and (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))} is VALID [2018-11-23 12:58:45,997 INFO L273 TraceCheckUtils]: 32: Hoare triple {1573#(and (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.base) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1577#(and (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.base) (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= dll_insert_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4)) dll_insert_~last~0.base))} is VALID [2018-11-23 12:58:45,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {1577#(and (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.base) (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= dll_insert_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4)) dll_insert_~last~0.base))} assume !(~index > 0); {1577#(and (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.base) (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= dll_insert_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4)) dll_insert_~last~0.base))} is VALID [2018-11-23 12:58:48,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {1577#(and (= (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.base) (exists ((node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) node_create_~temp~0.offset)))) (= dll_insert_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0) (= (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (+ dll_insert_~snd_to_last~0.offset 4)) dll_insert_~last~0.base))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, 8 + ~new_node~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1584#(and (exists ((dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) dll_insert_~last~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))} is UNKNOWN [2018-11-23 12:58:50,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {1584#(and (exists ((dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) dll_insert_~last~0.base))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) dll_insert_~last~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0))} assume ~last~0.base != 0 || ~last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, 8 + ~last~0.offset, 4); {1588#(exists ((dll_insert_~new_node~0.base Int) (dll_insert_~last~0.offset Int) (dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0)))} is UNKNOWN [2018-11-23 12:58:50,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {1588#(exists ((dll_insert_~new_node~0.base Int) (dll_insert_~last~0.offset Int) (dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0)))} assume true; {1588#(exists ((dll_insert_~new_node~0.base Int) (dll_insert_~last~0.offset Int) (dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0)))} is VALID [2018-11-23 12:58:50,023 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1588#(exists ((dll_insert_~new_node~0.base Int) (dll_insert_~last~0.offset Int) (dll_insert_~new_node~0.offset Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (+ dll_insert_~new_node~0.offset 8) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ dll_insert_~new_node~0.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4)))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) 4))) (+ dll_insert_~last~0.offset 8) dll_insert_~new_node~0.base))) (= (select |old(#valid)| dll_insert_~new_node~0.base) 0)))} {1540#(and (= 1 (select |#valid| (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) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) (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|)) 8) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= (select |#valid| |main_~#s~0.base|) 1) (exists ((v_subst_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|)) 4)) (+ v_subst_1 8)))))} #134#return; {1595#(or (and (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|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8) 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 ((node_create_~temp~0.offset Int) (v_subst_1 Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset)) (+ v_subst_1 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ node_create_~temp~0.offset 8))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (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|)) (+ |main_~#s~0.offset| 4))) (+ node_create_~temp~0.offset 4))) (not (= (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|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))))) (and (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|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8) 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 ((v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4))) (+ v_prenex_9 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (= (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|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 8))) (not (= (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|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))))))} is VALID [2018-11-23 12:58:50,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {1595#(or (and (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|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8) 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 ((node_create_~temp~0.offset Int) (v_subst_1 Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset)) (+ v_subst_1 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ node_create_~temp~0.offset 8))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (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|)) (+ |main_~#s~0.offset| 4))) (+ node_create_~temp~0.offset 4))) (not (= (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|)) (+ |main_~#s~0.offset| 4))) node_create_~temp~0.offset))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))))) (and (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|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8) 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 ((v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4))) (+ v_prenex_9 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (= (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|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 8))) (not (= (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|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))) (+ v_prenex_8 4)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ |main_~#s~0.offset| 4))))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0; {1460#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:58:50,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {1460#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1441#false} is VALID [2018-11-23 12:58:50,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {1441#false} assume ~count~0 != 1 + ~len~0; {1441#false} is VALID [2018-11-23 12:58:50,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2018-11-23 12:58:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:50,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:50,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2018-11-23 12:58:50,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-11-23 12:58:50,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:50,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:58:56,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 72 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:56,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:58:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:58:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1567, Unknown=23, NotChecked=0, Total=1722 [2018-11-23 12:58:56,335 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 42 states. [2018-11-23 12:59:33,504 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-11-23 12:59:44,614 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2018-11-23 12:59:51,376 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2018-11-23 12:59:57,839 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-11-23 13:00:12,824 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78