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_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:14:46,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:14:46,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:14:46,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:14:46,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:14:46,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:14:46,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:14:46,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:14:46,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:14:46,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:14:46,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:14:46,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:14:46,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:14:46,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:14:46,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:14:46,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:14:46,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:14:46,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:14:46,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:14:46,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:14:46,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:14:46,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:14:46,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:14:46,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:14:46,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:14:46,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:14:46,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:14:46,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:14:46,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:14:46,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:14:46,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:14:46,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:14:46,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:14:46,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:14:46,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:14:46,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:14:46,089 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:14:46,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:14:46,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:14:46,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:14:46,113 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:14:46,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:14:46,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:14:46,115 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:14:46,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:14:46,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:14:46,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:14:46,116 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:14:46,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:14:46,118 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:14:46,118 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:14:46,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:14:46,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:14:46,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:14:46,119 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:14:46,119 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:14:46,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:14:46,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:14:46,120 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:14:46,120 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:14:46,120 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:14:46,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:14:46,121 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:14:46,121 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:14:46,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:14:46,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:14:46,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:14:46,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:14:46,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:14:46,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:14:46,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:14:46,285 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57d4a909/85816b5fe9eb491fa77c3e1f598917f5/FLAG0d7e1e093 [2018-11-23 11:14:46,864 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:14:46,865 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:14:46,881 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57d4a909/85816b5fe9eb491fa77c3e1f598917f5/FLAG0d7e1e093 [2018-11-23 11:14:47,113 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57d4a909/85816b5fe9eb491fa77c3e1f598917f5 [2018-11-23 11:14:47,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:14:47,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:14:47,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:14:47,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:14:47,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:14:47,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcead6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47, skipping insertion in model container [2018-11-23 11:14:47,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:14:47,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:14:47,652 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:14:47,669 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:14:47,773 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:14:47,929 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:14:47,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47 WrapperNode [2018-11-23 11:14:47,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:14:47,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:14:47,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:14:47,931 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:14:47,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:14:47,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:14:47,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:14:47,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:14:47,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:47,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:48,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:48,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:48,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (1/1) ... [2018-11-23 11:14:48,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:14:48,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:14:48,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:14:48,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:14:48,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (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 11:14:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 11:14:48,098 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 11:14:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:14:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:14:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:14:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:14:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:14:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:14:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:14:48,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:14:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:14:48,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:14:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:14:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:14:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:14:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:14:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:14:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:14:48,102 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:14:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-23 11:14:48,102 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-23 11:14:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:14:48,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:14:49,253 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:14:49,254 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:14:49,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:14:49 BoogieIcfgContainer [2018-11-23 11:14:49,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:14:49,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:14:49,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:14:49,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:14:49,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:14:47" (1/3) ... [2018-11-23 11:14:49,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584c7e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:14:49, skipping insertion in model container [2018-11-23 11:14:49,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:14:47" (2/3) ... [2018-11-23 11:14:49,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584c7e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:14:49, skipping insertion in model container [2018-11-23 11:14:49,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:14:49" (3/3) ... [2018-11-23 11:14:49,263 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:14:49,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:14:49,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:14:49,300 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:14:49,329 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:14:49,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:14:49,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:14:49,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:14:49,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:14:49,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:14:49,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:14:49,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:14:49,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:14:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 11:14:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:14:49,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:49,358 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] [2018-11-23 11:14:49,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:49,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash 705287028, now seen corresponding path program 1 times [2018-11-23 11:14:49,373 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:49,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:49,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:49,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 11:14:49,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {54#true} is VALID [2018-11-23 11:14:49,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 11:14:49,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #123#return; {54#true} is VALID [2018-11-23 11:14:49,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret18 := main(); {54#true} is VALID [2018-11-23 11:14:49,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {74#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:49,955 INFO L256 TraceCheckUtils]: 6: Hoare triple {74#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {54#true} is VALID [2018-11-23 11:14:49,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {81#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:49,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:49,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:49,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:49,997 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {85#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {74#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #113#return; {55#false} is VALID [2018-11-23 11:14:49,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {55#false} is VALID [2018-11-23 11:14:49,998 INFO L256 TraceCheckUtils]: 13: Hoare triple {55#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {55#false} is VALID [2018-11-23 11:14:49,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {55#false} is VALID [2018-11-23 11:14:49,999 INFO L256 TraceCheckUtils]: 15: Hoare triple {55#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {55#false} is VALID [2018-11-23 11:14:49,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {55#false} is VALID [2018-11-23 11:14:50,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {55#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {55#false} is VALID [2018-11-23 11:14:50,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {55#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {55#false} is VALID [2018-11-23 11:14:50,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {55#false} assume true; {55#false} is VALID [2018-11-23 11:14:50,001 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {55#false} {55#false} #121#return; {55#false} is VALID [2018-11-23 11:14:50,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {55#false} is VALID [2018-11-23 11:14:50,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {55#false} is VALID [2018-11-23 11:14:50,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {55#false} is VALID [2018-11-23 11:14:50,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#false} assume true; {55#false} is VALID [2018-11-23 11:14:50,003 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {55#false} {55#false} #115#return; {55#false} is VALID [2018-11-23 11:14:50,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {55#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {55#false} is VALID [2018-11-23 11:14:50,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {55#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {55#false} is VALID [2018-11-23 11:14:50,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 11:14:50,010 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 11:14:50,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:14:50,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:14:50,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:14:50,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:14:50,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:50,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:14:50,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:50,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:14:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:14:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:14:50,317 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-11-23 11:14:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:52,051 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 11:14:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:14:52,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:14:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:14:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2018-11-23 11:14:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:14:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2018-11-23 11:14:52,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 122 transitions. [2018-11-23 11:14:52,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:52,440 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:14:52,440 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:14:52,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:14:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:14:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 11:14:52,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:52,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 11:14:52,709 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 11:14:52,709 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 11:14:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:52,715 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:14:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:14:52,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:52,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:52,716 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 11:14:52,716 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 11:14:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:52,722 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:14:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:14:52,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:52,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:52,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:52,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:14:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:14:52,729 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 29 [2018-11-23 11:14:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:52,729 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:14:52,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:14:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:14:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:14:52,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:52,731 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] [2018-11-23 11:14:52,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1889696853, now seen corresponding path program 1 times [2018-11-23 11:14:52,733 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:52,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:53,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2018-11-23 11:14:53,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {414#true} is VALID [2018-11-23 11:14:53,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 11:14:53,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #123#return; {414#true} is VALID [2018-11-23 11:14:53,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret18 := main(); {414#true} is VALID [2018-11-23 11:14:53,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {414#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {434#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:53,007 INFO L256 TraceCheckUtils]: 6: Hoare triple {434#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {414#true} is VALID [2018-11-23 11:14:53,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {414#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {441#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {441#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {441#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {441#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {441#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {441#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {441#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {441#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {441#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {441#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {457#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:14:53,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {457#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,028 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {434#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #113#return; {415#false} is VALID [2018-11-23 11:14:53,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {415#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {415#false} is VALID [2018-11-23 11:14:53,029 INFO L256 TraceCheckUtils]: 18: Hoare triple {415#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {415#false} is VALID [2018-11-23 11:14:53,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {415#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {415#false} is VALID [2018-11-23 11:14:53,030 INFO L256 TraceCheckUtils]: 20: Hoare triple {415#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {415#false} is VALID [2018-11-23 11:14:53,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {415#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {415#false} is VALID [2018-11-23 11:14:53,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {415#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {415#false} is VALID [2018-11-23 11:14:53,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {415#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {415#false} is VALID [2018-11-23 11:14:53,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {415#false} assume true; {415#false} is VALID [2018-11-23 11:14:53,031 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {415#false} {415#false} #121#return; {415#false} is VALID [2018-11-23 11:14:53,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {415#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {415#false} is VALID [2018-11-23 11:14:53,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {415#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {415#false} is VALID [2018-11-23 11:14:53,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {415#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {415#false} is VALID [2018-11-23 11:14:53,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {415#false} assume true; {415#false} is VALID [2018-11-23 11:14:53,033 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {415#false} {415#false} #115#return; {415#false} is VALID [2018-11-23 11:14:53,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {415#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {415#false} is VALID [2018-11-23 11:14:53,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {415#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {415#false} is VALID [2018-11-23 11:14:53,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {415#false} assume !false; {415#false} is VALID [2018-11-23 11:14:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:14:53,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:14:53,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {415#false} assume !false; {415#false} is VALID [2018-11-23 11:14:53,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {415#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {415#false} is VALID [2018-11-23 11:14:53,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {415#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {415#false} is VALID [2018-11-23 11:14:53,396 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {414#true} {415#false} #115#return; {415#false} is VALID [2018-11-23 11:14:53,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 11:14:53,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {414#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {414#true} is VALID [2018-11-23 11:14:53,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {414#true} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {414#true} is VALID [2018-11-23 11:14:53,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {414#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {414#true} is VALID [2018-11-23 11:14:53,397 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {414#true} {414#true} #121#return; {414#true} is VALID [2018-11-23 11:14:53,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 11:14:53,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {414#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {414#true} is VALID [2018-11-23 11:14:53,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {414#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {414#true} is VALID [2018-11-23 11:14:53,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {414#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {414#true} is VALID [2018-11-23 11:14:53,399 INFO L256 TraceCheckUtils]: 20: Hoare triple {414#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {414#true} is VALID [2018-11-23 11:14:53,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {414#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {414#true} is VALID [2018-11-23 11:14:53,399 INFO L256 TraceCheckUtils]: 18: Hoare triple {415#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {414#true} is VALID [2018-11-23 11:14:53,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {415#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {415#false} is VALID [2018-11-23 11:14:53,402 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {573#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #113#return; {415#false} is VALID [2018-11-23 11:14:53,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {461#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:53,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {586#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {414#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {590#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:53,414 INFO L256 TraceCheckUtils]: 6: Hoare triple {573#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {414#true} is VALID [2018-11-23 11:14:53,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {414#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {573#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:53,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret18 := main(); {414#true} is VALID [2018-11-23 11:14:53,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #123#return; {414#true} is VALID [2018-11-23 11:14:53,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 11:14:53,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {414#true} is VALID [2018-11-23 11:14:53,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2018-11-23 11:14:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:14:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:14:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:14:53,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 11:14:53,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:53,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:14:53,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:53,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:14:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:14:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:14:53,613 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 9 states. [2018-11-23 11:14:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:55,831 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 11:14:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:14:55,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 11:14:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:14:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-23 11:14:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:14:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-23 11:14:55,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2018-11-23 11:14:56,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:56,126 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:14:56,126 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:14:56,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:14:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:14:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 11:14:56,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:56,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 11:14:56,146 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 11:14:56,146 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 11:14:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:56,150 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 11:14:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 11:14:56,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:56,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:56,151 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 11:14:56,151 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 11:14:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:56,155 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 11:14:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 11:14:56,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:56,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:56,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:56,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:14:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-23 11:14:56,159 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2018-11-23 11:14:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:56,160 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-23 11:14:56,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:14:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 11:14:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:14:56,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:56,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:56,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:56,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 951213524, now seen corresponding path program 2 times [2018-11-23 11:14:56,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:56,164 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:56,187 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:14:56,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:14:56,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:14:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:56,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:56,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {874#true} call ULTIMATE.init(); {874#true} is VALID [2018-11-23 11:14:56,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {874#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {874#true} is VALID [2018-11-23 11:14:56,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {874#true} assume true; {874#true} is VALID [2018-11-23 11:14:56,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {874#true} {874#true} #123#return; {874#true} is VALID [2018-11-23 11:14:56,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {874#true} call #t~ret18 := main(); {874#true} is VALID [2018-11-23 11:14:56,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {874#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {874#true} is VALID [2018-11-23 11:14:56,430 INFO L256 TraceCheckUtils]: 6: Hoare triple {874#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {874#true} is VALID [2018-11-23 11:14:56,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {874#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {874#true} is VALID [2018-11-23 11:14:56,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {874#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {875#false} is VALID [2018-11-23 11:14:56,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {875#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {875#false} is VALID [2018-11-23 11:14:56,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {875#false} assume !~bvsgt32(~len, 0bv32); {875#false} is VALID [2018-11-23 11:14:56,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {875#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {875#false} is VALID [2018-11-23 11:14:56,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {875#false} assume true; {875#false} is VALID [2018-11-23 11:14:56,443 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {875#false} {874#true} #113#return; {875#false} is VALID [2018-11-23 11:14:56,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {875#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {875#false} is VALID [2018-11-23 11:14:56,443 INFO L256 TraceCheckUtils]: 23: Hoare triple {875#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {875#false} is VALID [2018-11-23 11:14:56,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {875#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {875#false} is VALID [2018-11-23 11:14:56,444 INFO L256 TraceCheckUtils]: 25: Hoare triple {875#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {875#false} is VALID [2018-11-23 11:14:56,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {875#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {875#false} is VALID [2018-11-23 11:14:56,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {875#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {875#false} is VALID [2018-11-23 11:14:56,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {875#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {875#false} is VALID [2018-11-23 11:14:56,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {875#false} assume true; {875#false} is VALID [2018-11-23 11:14:56,445 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {875#false} {875#false} #121#return; {875#false} is VALID [2018-11-23 11:14:56,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {875#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {875#false} is VALID [2018-11-23 11:14:56,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {875#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {875#false} is VALID [2018-11-23 11:14:56,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {875#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {875#false} is VALID [2018-11-23 11:14:56,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {875#false} assume true; {875#false} is VALID [2018-11-23 11:14:56,447 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {875#false} {875#false} #115#return; {875#false} is VALID [2018-11-23 11:14:56,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {875#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {875#false} is VALID [2018-11-23 11:14:56,447 INFO L273 TraceCheckUtils]: 37: Hoare triple {875#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {875#false} is VALID [2018-11-23 11:14:56,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {875#false} assume !false; {875#false} is VALID [2018-11-23 11:14:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:14:56,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:14:56,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {875#false} assume !false; {875#false} is VALID [2018-11-23 11:14:56,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {875#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {875#false} is VALID [2018-11-23 11:14:56,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {875#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {875#false} is VALID [2018-11-23 11:14:56,576 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {874#true} {875#false} #115#return; {875#false} is VALID [2018-11-23 11:14:56,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {874#true} assume true; {874#true} is VALID [2018-11-23 11:14:56,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {874#true} is VALID [2018-11-23 11:14:56,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#true} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {874#true} is VALID [2018-11-23 11:14:56,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {874#true} is VALID [2018-11-23 11:14:56,578 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {874#true} {874#true} #121#return; {874#true} is VALID [2018-11-23 11:14:56,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {874#true} assume true; {874#true} is VALID [2018-11-23 11:14:56,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {874#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {874#true} is VALID [2018-11-23 11:14:56,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {874#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {874#true} is VALID [2018-11-23 11:14:56,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {874#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {874#true} is VALID [2018-11-23 11:14:56,579 INFO L256 TraceCheckUtils]: 25: Hoare triple {874#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {874#true} is VALID [2018-11-23 11:14:56,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {874#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {874#true} is VALID [2018-11-23 11:14:56,579 INFO L256 TraceCheckUtils]: 23: Hoare triple {875#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {874#true} is VALID [2018-11-23 11:14:56,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {875#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {875#false} is VALID [2018-11-23 11:14:56,580 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {875#false} {874#true} #113#return; {875#false} is VALID [2018-11-23 11:14:56,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {875#false} assume true; {875#false} is VALID [2018-11-23 11:14:56,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {875#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {875#false} is VALID [2018-11-23 11:14:56,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {875#false} assume !~bvsgt32(~len, 0bv32); {875#false} is VALID [2018-11-23 11:14:56,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {875#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {875#false} is VALID [2018-11-23 11:14:56,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {875#false} is VALID [2018-11-23 11:14:56,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {916#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {916#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-23 11:14:56,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {874#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {903#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:14:56,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {874#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {874#true} is VALID [2018-11-23 11:14:56,587 INFO L256 TraceCheckUtils]: 6: Hoare triple {874#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {874#true} is VALID [2018-11-23 11:14:56,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {874#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {874#true} is VALID [2018-11-23 11:14:56,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {874#true} call #t~ret18 := main(); {874#true} is VALID [2018-11-23 11:14:56,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {874#true} {874#true} #123#return; {874#true} is VALID [2018-11-23 11:14:56,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {874#true} assume true; {874#true} is VALID [2018-11-23 11:14:56,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {874#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {874#true} is VALID [2018-11-23 11:14:56,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {874#true} call ULTIMATE.init(); {874#true} is VALID [2018-11-23 11:14:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:14:56,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:14:56,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 11:14:56,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:14:56,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:56,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:14:56,735 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 11:14:56,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:14:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:14:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:14:56,736 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2018-11-23 11:14:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:57,604 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 11:14:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:14:57,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:14:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:14:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-23 11:14:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:14:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-23 11:14:57,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2018-11-23 11:14:57,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:57,747 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:14:57,747 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:14:57,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:14:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:14:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:14:57,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:57,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:14:57,781 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:14:57,781 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:14:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:57,784 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:14:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:14:57,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:57,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:57,785 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:14:57,785 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:14:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:57,788 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:14:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:14:57,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:57,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:57,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:57,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:14:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 11:14:57,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 39 [2018-11-23 11:14:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 11:14:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:14:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:14:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:14:57,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:57,795 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] [2018-11-23 11:14:57,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:57,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1538315438, now seen corresponding path program 1 times [2018-11-23 11:14:57,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:57,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:14:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:58,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:58,108 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 11:14:58,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:58,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:58,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:14:58,131 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:58,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_66|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= |#valid| (store |v_#valid_66| |main_~#s~0.base| (_ bv1 1)))) [2018-11-23 11:14:58,132 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:14:58,768 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-23 11:15:00,854 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-23 11:15:02,928 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-23 11:15:05,011 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-23 11:15:05,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:05,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:05,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-23 11:15:05,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:15:05,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,131 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 11:15:05,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-11-23 11:15:07,155 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:07,156 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_2|, |dll_create_#t~malloc3.base|]. (and (= (select |v_#valid_BEFORE_CALL_2| |dll_create_#t~malloc3.base|) (_ bv0 1)) (= (bvadd (select |v_#valid_BEFORE_CALL_2| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= |#valid| (store (store |v_#valid_BEFORE_CALL_2| |dll_create_#t~malloc3.base| (_ bv1 1)) |main_#t~ret10.base| (_ bv1 1)))) [2018-11-23 11:15:07,156 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|dll_create_#t~malloc3.base|]. (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|))) [2018-11-23 11:15:07,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:07,556 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 8 treesize of output 7 [2018-11-23 11:15:07,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:07,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:07,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:07,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-23 11:15:08,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:15:08,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:08,073 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 22 treesize of output 14 [2018-11-23 11:15:08,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:08,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:08,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:08,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:08,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:08,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-11-23 11:15:15,858 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:15,858 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_71|, |v_#memory_int_69|]. (let ((.cse0 (select |v_#memory_int_69| dll_prepend_~new_head~1.base)) (.cse1 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32))) (.cse2 (select |v_#memory_$Pointer$.base_71| dll_prepend_~new_head~1.base))) (and (= (store |v_#memory_int_69| dll_prepend_~new_head~1.base (store .cse0 .cse1 (select (select |#memory_int| dll_prepend_~new_head~1.base) .cse1))) |#memory_int|) (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select .cse0 (_ bv0 32)) |dll_prepend_#in~data|) (= (store |v_#memory_$Pointer$.base_71| dll_prepend_~new_head~1.base (store .cse2 .cse1 (select (select |v_#memory_$Pointer$.base_71| dll_prepend_~head.base) dll_prepend_~head.offset))) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_71| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select .cse2 (_ bv0 32))))) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))) [2018-11-23 11:15:15,859 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse0 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse0 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse0) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) [2018-11-23 11:15:18,095 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:15:18,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-23 11:15:18,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2018-11-23 11:15:18,171 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 11:15:18,198 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 11:15:18,480 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-11-23 11:15:18,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 203 [2018-11-23 11:15:18,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 99 [2018-11-23 11:15:18,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:18,846 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 106 treesize of output 7 [2018-11-23 11:15:18,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:18,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:19,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:15:19,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2018-11-23 11:15:21,416 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:21,417 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_DerPreprocessor_2, |v_#memory_$Pointer$.offset_70|, |v_#memory_int_70|]. (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |v_#memory_int_70| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |#memory_int| (let ((.cse0 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse2 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse2 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse2) dll_prepend_~head.base) dll_prepend_~head.offset)))) dll_prepend_~head.base) dll_prepend_~head.offset))) (store |v_#memory_int_70| .cse0 (let ((.cse1 (bvadd (select (select |v_#memory_$Pointer$.offset_70| dll_prepend_~head.base) dll_prepend_~head.offset) (_ bv8 32)))) (store (select |v_#memory_int_70| .cse0) .cse1 (select (select |#memory_int| .cse0) .cse1)))))) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) [2018-11-23 11:15:21,417 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (.cse2 (= (_ bv0 32) dll_prepend_~new_head~1.offset)) (.cse4 (= |dll_prepend_#in~head.base| dll_prepend_~head.base))) (or (and .cse0 .cse1 .cse2 (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse3 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse3) dll_prepend_~head.base) dll_prepend_~head.offset)))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base) .cse4) (and .cse0 .cse1 (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) .cse2 .cse4))) [2018-11-23 11:15:21,792 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:15:21,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-23 11:15:21,868 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 8 treesize of output 7 [2018-11-23 11:15:21,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 11:15:22,098 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 8 treesize of output 7 [2018-11-23 11:15:22,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 70 [2018-11-23 11:15:23,028 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 55 treesize of output 43 [2018-11-23 11:15:23,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2018-11-23 11:15:23,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:23,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:23,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2018-11-23 11:15:23,800 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 12 treesize of output 1 [2018-11-23 11:15:23,801 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,877 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 11:15:24,197 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 8 treesize of output 7 [2018-11-23 11:15:24,198 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,280 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 11:15:24,294 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 8 treesize of output 7 [2018-11-23 11:15:24,296 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,315 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-23 11:15:24,347 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 8 treesize of output 7 [2018-11-23 11:15:24,350 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,368 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:24,583 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:136, output treesize:135 [2018-11-23 11:15:26,603 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:26,603 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_73|, dll_prepend_~new_head~1.base, |v_#memory_int_71|, |v_#memory_$Pointer$.offset_71|, v_DerPreprocessor_2, v_prenex_2]. (let ((.cse0 (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= (store |v_#memory_$Pointer$.base_73| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.base_73| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)) |#memory_$Pointer$.base|)) (.cse3 (select (select |#memory_int| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (.cse2 (= (store |v_#memory_$Pointer$.offset_71| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.offset_71| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| (_ bv0 32))) |#memory_$Pointer$.offset|))) (or (and .cse0 .cse1 (= (select (select v_prenex_2 dll_prepend_~new_head~1.base) (_ bv0 32)) |dll_prepend_#in~data|) .cse2 (= (store v_prenex_2 |dll_prepend_#in~head.base| (store (select v_prenex_2 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse3)) |#memory_int|)) (and .cse0 .cse1 (= (store |v_#memory_int_71| |dll_prepend_#in~head.base| (store (select |v_#memory_int_71| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse3)) |#memory_int|) .cse2 (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse4 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse4 (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse4) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) dll_prepend_~new_head~1.base)))) [2018-11-23 11:15:26,604 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (let ((.cse1 (= (_ bv0 1) (select |old(#valid)| .cse0))) (.cse2 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (or (and (= |dll_prepend_#in~head.base| .cse0) .cse1 (= (_ bv0 32) |dll_prepend_#in~head.offset|) .cse2) (and .cse1 (= .cse0 (select (select (store |old(#memory_$Pointer$.base)| .cse0 (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| .cse0) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse3 (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| .cse0 .cse3) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) .cse2) (and .cse1 (= |dll_prepend_#in~data| (select (select |#memory_int| .cse0) (_ bv0 32))) .cse2)))) [2018-11-23 11:15:26,906 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-23 11:15:27,146 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2018-11-23 11:15:27,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:27,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:27,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:27,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:27,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-11-23 11:15:27,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,214 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 12 treesize of output 10 [2018-11-23 11:15:27,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-23 11:15:27,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,258 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:174, output treesize:35 [2018-11-23 11:15:27,272 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:27,273 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_4|, v_DerPreprocessor_2, |dll_create_#t~malloc3.base|, |v_old(#valid)_AFTER_CALL_28|, v_prenex_4, v_prenex_6, v_prenex_5]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32))) (.cse2 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse3 (= |main_~#s~0.offset| (_ bv0 32)))) (or (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) .cse0 (= (select |v_old(#valid)_AFTER_CALL_28| |dll_create_#t~malloc3.base|) (_ bv1 1)) (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_28| (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_28| .cse1)) .cse2 .cse3 (= (select (select (store |v_#memory_$Pointer$.base_BEFORE_CALL_4| .cse1 (let ((.cse4 (store (store (store (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| .cse1) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse4 (_ bv4 32) (select (select (store |v_#memory_$Pointer$.base_BEFORE_CALL_4| .cse1 .cse4) |main_~#s~0.base|) |main_~#s~0.offset|)))) |main_~#s~0.base|) |main_~#s~0.offset|) .cse1) (= (bvadd (select |v_old(#valid)_AFTER_CALL_28| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))) (and (not (= |main_~#s~0.base| v_prenex_4)) (= (select (select |#memory_int| .cse1) (_ bv0 32)) main_~uneq~0) (= (_ bv0 1) (select v_prenex_6 .cse1)) .cse0 .cse2 (= (select v_prenex_6 v_prenex_4) (_ bv1 1)) .cse3 (= (_ bv1 1) (select v_prenex_6 (select (select v_prenex_5 |main_~#s~0.base|) |main_~#s~0.offset|))) (= (bvadd (select v_prenex_6 |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))))) [2018-11-23 11:15:27,273 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| .cse0)))) [2018-11-23 11:15:27,391 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 27 treesize of output 15 [2018-11-23 11:15:27,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:15:27,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 11:15:27,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:15:27,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 11:15:27,486 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:27,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2018-11-23 11:15:27,501 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:27,501 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_int|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (.cse2 (select |#memory_int| .cse1))) (and (= (_ bv0 32) .cse0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#s~0.base| .cse1)) (= |main_#t~mem12| (select .cse2 .cse0)) (= main_~uneq~0 (select .cse2 (_ bv0 32)))))) [2018-11-23 11:15:27,501 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem12| main_~uneq~0)) [2018-11-23 11:15:27,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 11:15:27,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 11:15:27,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 11:15:27,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #123#return; {1351#true} is VALID [2018-11-23 11:15:27,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret18 := main(); {1351#true} is VALID [2018-11-23 11:15:27,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:27,579 INFO L256 TraceCheckUtils]: 6: Hoare triple {1371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1375#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:15:27,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {1375#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1375#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:15:27,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {1375#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !~bvsgt32(~len, 0bv32); {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume true; {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:15:27,606 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} {1371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #113#return; {1425#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} is VALID [2018-11-23 11:15:27,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {1425#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {1429#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:15:27,609 INFO L256 TraceCheckUtils]: 23: Hoare triple {1429#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:27,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:15:27,616 INFO L256 TraceCheckUtils]: 25: Hoare triple {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:27,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:15:27,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:15:27,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:27,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:27,624 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #121#return; {1458#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (bvadd |dll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |dll_prepend_#t~ret6.offset| (_ bv8 32)) (_ bv0 32)) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|))) |#memory_$Pointer$.base|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:15:27,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {1458#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (bvadd |dll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |dll_prepend_#t~ret6.offset| (_ bv8 32)) (_ bv0 32)) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|))) |#memory_$Pointer$.base|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1462#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:15:27,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {1462#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1466#(or (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)))} is VALID [2018-11-23 11:15:27,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#(or (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 11:15:27,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} assume true; {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 11:15:27,753 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} {1429#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #115#return; {1477#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:15:27,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {1477#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1481#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem12| main_~uneq~0))} is VALID [2018-11-23 11:15:27,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {1481#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem12| main_~uneq~0))} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1352#false} is VALID [2018-11-23 11:15:27,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 11:15:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-23 11:15:27,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:28,079 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:15:28,198 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:15:28,403 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:15:28,606 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:15:35,951 WARN L180 SmtUtils]: Spent 7.31 s on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 11:15:38,213 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-23 11:15:40,680 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 11:15:43,724 WARN L180 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 11:15:46,190 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:15:46,210 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 11:15:46,262 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 11:15:46,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:46,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:46,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2018-11-23 11:15:46,810 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2018-11-23 11:15:46,839 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:46,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:47,229 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:47,284 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:47,459 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:47,494 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:47,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 120 [2018-11-23 11:15:47,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 11:15:47,680 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 16 treesize of output 17 [2018-11-23 11:15:47,682 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:47,773 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:48,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 112 [2018-11-23 11:15:49,018 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2018-11-23 11:15:49,030 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 78 treesize of output 77 [2018-11-23 11:15:49,034 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,692 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:49,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:49,705 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 101 [2018-11-23 11:15:49,718 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,751 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:49,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:49,800 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 101 [2018-11-23 11:15:49,804 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 128 [2018-11-23 11:15:49,948 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-11-23 11:15:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-23 11:15:50,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 11:15:50,927 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,975 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 8 treesize of output 1 [2018-11-23 11:15:50,977 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,011 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 51 [2018-11-23 11:15:51,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:51,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 11:15:51,839 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,869 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 51 [2018-11-23 11:15:51,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:51,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 11:15:51,958 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,044 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 32 [2018-11-23 11:15:52,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2018-11-23 11:15:52,148 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-11-23 11:15:52,219 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:15:52,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 32 [2018-11-23 11:15:52,232 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:52,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:15:52,243 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,265 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 32 [2018-11-23 11:15:52,282 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:52,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:15:52,288 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,307 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,598 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:15:52,745 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:15:52,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:52,935 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 7 variables, input treesize:147, output treesize:76 [2018-11-23 11:15:55,118 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:55,119 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_91|, v_dll_prepend_~new_head~1.base_12, |v_#memory_int_89|, |v_#memory_$Pointer$.offset_84|, |v_#memory_int_88|, |v_#memory_int_91|, |v_#memory_int_90|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_91| v_dll_prepend_~new_head~1.base_12))) (or (not (= (store |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_12 (store (store (store (select |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select .cse0 (_ bv0 32)))) |v_#memory_$Pointer$.base_91|)) (not (= (store |v_#memory_int_89| |main_~#s~0.base| (store (select |v_#memory_int_89| |main_~#s~0.base|) |main_~#s~0.offset| (select (select |v_#memory_int_91| |main_~#s~0.base|) |main_~#s~0.offset|))) |v_#memory_int_91|)) (= main_~uneq~0 (select (select |v_#memory_int_91| v_dll_prepend_~new_head~1.base_12) (_ bv0 32))) (not (= (store |v_#memory_int_90| v_dll_prepend_~new_head~1.base_12 (store (store (select |v_#memory_int_90| v_dll_prepend_~new_head~1.base_12) (_ bv0 32) main_~uneq~0) (_ bv4 32) (select (select |v_#memory_int_88| v_dll_prepend_~new_head~1.base_12) (_ bv4 32)))) |v_#memory_int_88|)) (not (= (let ((.cse1 (select (select (store |v_#memory_$Pointer$.base_91| v_dll_prepend_~new_head~1.base_12 (store .cse0 (_ bv4 32) (select (select |v_#memory_$Pointer$.base_91| |main_~#s~0.base|) |main_~#s~0.offset|))) |main_~#s~0.base|) |main_~#s~0.offset|))) (store |v_#memory_int_88| .cse1 (let ((.cse2 (bvadd (select (select |v_#memory_$Pointer$.offset_84| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv8 32)))) (store (select |v_#memory_int_88| .cse1) .cse2 (select (select |v_#memory_int_89| .cse1) .cse2))))) |v_#memory_int_89|)) (not (= (_ bv0 1) (select |#valid| v_dll_prepend_~new_head~1.base_12))))) [2018-11-23 11:15:55,119 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_11, v_prenex_10, v_dll_prepend_~new_head~1.base_12, v_DerPreprocessor_10]. (let ((.cse0 (= |main_~#s~0.offset| (_ bv0 32)))) (and (or (= v_prenex_11 |main_~#s~0.base|) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_11 (store (store (store (select |#memory_$Pointer$.base| v_prenex_11) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_prenex_10)) |main_~#s~0.base|) |main_~#s~0.offset|) v_prenex_11)) (not (= (_ bv0 1) (select |#valid| v_prenex_11)))) (or .cse0 (not (= (select (select (store |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_12 (store (store (store (select |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_10)) |main_~#s~0.base|) |main_~#s~0.offset|) v_dll_prepend_~new_head~1.base_12)) (not (= (_ bv0 1) (select |#valid| v_dll_prepend_~new_head~1.base_12)))) (or (not .cse0) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1)))))) [2018-11-23 11:15:55,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:15:55,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:15:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:55,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:55,508 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 11:15:55,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:55,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:55,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:15:55,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:55,527 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_85|]. (= |#valid| (store |v_#valid_85| |main_~#s~0.base| (_ bv1 1))) [2018-11-23 11:15:55,528 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) [2018-11-23 11:15:55,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:55,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:55,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-23 11:15:55,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:15:55,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:55,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:55,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:55,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-11-23 11:15:57,807 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:57,807 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_12|, |dll_create_#t~malloc3.base|]. (and (= (_ bv0 1) (select |v_#valid_BEFORE_CALL_12| |dll_create_#t~malloc3.base|)) (= (bvadd (select |v_#valid_BEFORE_CALL_12| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |#valid| (store (store |v_#valid_BEFORE_CALL_12| |dll_create_#t~malloc3.base| (_ bv1 1)) |main_#t~ret10.base| (_ bv1 1)))) [2018-11-23 11:15:57,808 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|dll_create_#t~malloc3.base|]. (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|))) [2018-11-23 11:15:58,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:58,138 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 8 treesize of output 7 [2018-11-23 11:15:58,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-23 11:15:58,253 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 11:15:58,282 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 11:15:58,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:15:58,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:58,573 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 22 treesize of output 14 [2018-11-23 11:15:58,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:58,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:70 [2018-11-23 11:15:59,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-23 11:15:59,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2018-11-23 11:15:59,407 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 11:15:59,432 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 11:15:59,733 INFO L303 Elim1Store]: Index analysis took 155 ms [2018-11-23 11:15:59,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 203 [2018-11-23 11:15:59,928 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 151 treesize of output 53 [2018-11-23 11:15:59,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 99 [2018-11-23 11:16:00,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:00,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:00,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:16:00,360 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2018-11-23 11:16:05,426 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:05,426 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_DerPreprocessor_2, |v_#memory_$Pointer$.offset_86|, |v_#memory_int_94|]. (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (let ((.cse0 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse2 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse2 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse2) dll_prepend_~head.base) dll_prepend_~head.offset)))) dll_prepend_~head.base) dll_prepend_~head.offset))) (store |v_#memory_int_94| .cse0 (let ((.cse1 (bvadd (select (select |v_#memory_$Pointer$.offset_86| dll_prepend_~head.base) dll_prepend_~head.offset) (_ bv8 32)))) (store (select |v_#memory_int_94| .cse0) .cse1 (select (select |#memory_int| .cse0) .cse1))))) |#memory_int|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |v_#memory_int_94| dll_prepend_~new_head~1.base) (_ bv0 32)) |dll_prepend_#in~data|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) [2018-11-23 11:16:05,426 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (.cse2 (= (_ bv0 32) dll_prepend_~new_head~1.offset)) (.cse4 (= |dll_prepend_#in~head.base| dll_prepend_~head.base))) (or (and .cse0 .cse1 .cse2 (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse3 (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse3) dll_prepend_~head.base) dll_prepend_~head.offset)))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base) .cse4) (and .cse0 .cse1 (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) .cse2 .cse4))) [2018-11-23 11:16:05,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 62 [2018-11-23 11:16:05,675 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 51 treesize of output 39 [2018-11-23 11:16:05,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:05,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2018-11-23 11:16:05,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:06,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:06,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-23 11:16:06,886 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 8 treesize of output 7 [2018-11-23 11:16:06,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:06,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:06,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 11:16:06,933 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 8 treesize of output 7 [2018-11-23 11:16:06,934 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:06,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:07,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 11:16:07,060 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 8 treesize of output 7 [2018-11-23 11:16:07,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:07,258 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:07,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-23 11:16:07,906 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 8 treesize of output 7 [2018-11-23 11:16:07,935 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,062 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2018-11-23 11:16:08,191 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 8 treesize of output 7 [2018-11-23 11:16:08,216 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,352 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-23 11:16:08,367 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 8 treesize of output 7 [2018-11-23 11:16:08,370 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,388 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-11-23 11:16:08,746 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 12 treesize of output 1 [2018-11-23 11:16:08,747 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,806 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:08,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 11:16:08,992 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:136, output treesize:135 [2018-11-23 11:16:11,049 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:11,050 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_99|, dll_prepend_~new_head~1.base, v_DerPreprocessor_2, |v_#memory_int_95|, |v_#memory_$Pointer$.offset_87|, v_prenex_12]. (let ((.cse0 (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_99| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.base_99| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))) (.cse2 (select (select |#memory_int| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (.cse3 (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.offset_87| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| (_ bv0 32)))))) (or (and .cse0 .cse1 (= (store v_prenex_12 |dll_prepend_#in~head.base| (store (select v_prenex_12 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse2)) |#memory_int|) (= (select (select v_prenex_12 dll_prepend_~new_head~1.base) (_ bv0 32)) |dll_prepend_#in~data|) .cse3) (and .cse0 .cse1 (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse4 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse4 (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse4) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) dll_prepend_~new_head~1.base) (= |#memory_int| (store |v_#memory_int_95| |dll_prepend_#in~head.base| (store (select |v_#memory_int_95| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse2))) .cse3))) [2018-11-23 11:16:11,050 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (let ((.cse1 (= (_ bv0 1) (select |old(#valid)| .cse0))) (.cse2 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (or (and (= |dll_prepend_#in~head.base| .cse0) .cse1 (= (_ bv0 32) |dll_prepend_#in~head.offset|) .cse2) (and .cse1 (= .cse0 (select (select (store |old(#memory_$Pointer$.base)| .cse0 (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| .cse0) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse3 (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| .cse0 .cse3) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) .cse2) (and .cse1 (= |dll_prepend_#in~data| (select (select |#memory_int| .cse0) (_ bv0 32))) .cse2)))) [2018-11-23 11:16:11,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:11,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:11,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:11,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:11,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-11-23 11:16:11,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:11,888 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 12 treesize of output 10 [2018-11-23 11:16:11,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-23 11:16:11,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:11,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:11,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:11,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:158, output treesize:27 [2018-11-23 11:16:11,951 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:11,952 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_12|, |v_#valid_BEFORE_CALL_16|, |dll_create_#t~malloc3.base|, v_prenex_15, v_DerPreprocessor_2, v_prenex_14, v_prenex_16]. (let ((.cse1 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (and (= (_ bv1 1) (select |v_#valid_BEFORE_CALL_16| (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_12| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (select |v_#valid_BEFORE_CALL_16| |dll_create_#t~malloc3.base|) (_ bv1 1)) (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~uneq~0) (= (bvadd (select |v_#valid_BEFORE_CALL_16| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) .cse1 (= (select |v_#valid_BEFORE_CALL_16| .cse0) (_ bv0 1))) (and (not (= |main_~#s~0.base| v_prenex_14)) (= (select v_prenex_16 v_prenex_14) (_ bv1 1)) .cse1 (= (select v_prenex_16 .cse0) (_ bv0 1)) (= (_ bv1 1) (select v_prenex_16 (select (select v_prenex_15 |main_~#s~0.base|) |main_~#s~0.offset|))) (= .cse0 (select (select (store v_prenex_15 .cse0 (let ((.cse2 (store (store (store (select v_prenex_15 .cse0) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2))) (store .cse2 (_ bv4 32) (select (select (store v_prenex_15 .cse0 .cse2) |main_~#s~0.base|) |main_~#s~0.offset|)))) |main_~#s~0.base|) |main_~#s~0.offset|)) (= (bvadd (select v_prenex_16 |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))))) [2018-11-23 11:16:11,952 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~uneq~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= |main_~#s~0.base| .cse0)))) [2018-11-23 11:16:12,086 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 27 treesize of output 15 [2018-11-23 11:16:12,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:16:12,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 11:16:12,133 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 5 treesize of output 1 [2018-11-23 11:16:12,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:16:12,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 11:16:12,165 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,169 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2018-11-23 11:16:12,175 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:12,176 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |main_~#s~0.offset|, |#memory_int|, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |#memory_int| .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select .cse0 .cse1) |main_#t~mem12|) (= (select .cse0 (_ bv0 32)) main_~uneq~0) (= .cse1 (_ bv0 32)) (not (= |main_~#s~0.base| .cse2))))) [2018-11-23 11:16:12,176 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem12| main_~uneq~0) [2018-11-23 11:16:12,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 11:16:12,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 11:16:12,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 11:16:12,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #123#return; {1351#true} is VALID [2018-11-23 11:16:12,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret18 := main(); {1351#true} is VALID [2018-11-23 11:16:12,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1518#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:12,184 INFO L256 TraceCheckUtils]: 6: Hoare triple {1518#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1375#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:12,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1375#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1375#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:12,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {1375#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {1382#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {1398#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !~bvsgt32(~len, 0bv32); {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {1411#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume true; {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-23 11:16:12,204 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1418#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} {1518#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #113#return; {1567#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} is VALID [2018-11-23 11:16:12,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {1571#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:16:12,206 INFO L256 TraceCheckUtils]: 23: Hoare triple {1571#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:12,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:16:12,208 INFO L256 TraceCheckUtils]: 25: Hoare triple {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:12,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {1433#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:12,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:12,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {1444#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:12,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:12,251 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1451#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.base|) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1437#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #121#return; {1458#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (bvadd |dll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |dll_prepend_#t~ret6.offset| (_ bv8 32)) (_ bv0 32)) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|))) |#memory_$Pointer$.base|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:16:12,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {1458#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (bvadd |dll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |dll_prepend_#t~ret6.offset| (_ bv8 32)) (_ bv0 32)) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|))) |#memory_$Pointer$.base|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1462#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-23 11:16:12,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {1462#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1466#(or (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)))} is VALID [2018-11-23 11:16:12,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#(or (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~data| (select (select |#memory_int| dll_prepend_~new_head~1.base) (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base)))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 11:16:12,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} assume true; {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 11:16:12,353 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1470#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} {1571#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #115#return; {1611#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:16:12,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {1611#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1491#(= |main_#t~mem12| main_~uneq~0)} is VALID [2018-11-23 11:16:12,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {1491#(= |main_#t~mem12| main_~uneq~0)} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1352#false} is VALID [2018-11-23 11:16:12,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 11:16:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-23 11:16:12,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:12,567 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:16:12,725 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:16:12,970 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:16:13,190 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:16:22,651 WARN L180 SmtUtils]: Spent 9.42 s on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 11:16:24,933 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:16:28,162 WARN L180 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 90 [2018-11-23 11:16:30,507 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 86 [2018-11-23 11:16:32,980 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:16:32,992 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 11:16:33,050 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 11:16:33,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,490 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2018-11-23 11:16:33,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2018-11-23 11:16:33,702 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,865 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,903 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:34,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 120 [2018-11-23 11:16:34,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 11:16:34,124 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 16 treesize of output 17 [2018-11-23 11:16:34,126 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,177 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,370 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-23 11:16:34,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 112 [2018-11-23 11:16:35,329 WARN L180 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-23 11:16:35,341 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 78 treesize of output 77 [2018-11-23 11:16:35,347 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 128 [2018-11-23 11:16:36,218 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-11-23 11:16:36,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:36,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:36,290 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:36,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 101 [2018-11-23 11:16:36,296 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,305 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:36,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:36,319 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:36,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 101 [2018-11-23 11:16:36,325 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:37,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2018-11-23 11:16:37,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-11-23 11:16:37,561 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-11-23 11:16:37,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-11-23 11:16:37,756 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:37,981 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:16:38,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2018-11-23 11:16:38,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-11-23 11:16:38,698 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,723 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2018-11-23 11:16:38,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-11-23 11:16:38,759 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,784 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2018-11-23 11:16:38,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:38,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:16:38,846 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:38,875 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:38,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2018-11-23 11:16:38,905 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:38,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:16:38,925 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:39,002 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:39,311 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:16:39,437 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:16:39,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 11:16:39,590 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 8 variables, input treesize:147, output treesize:76 [2018-11-23 11:16:41,963 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:41,963 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_118|, v_dll_prepend_~new_head~1.base_15, |v_#memory_int_112|, |v_#memory_$Pointer$.offset_100|, |v_#memory_int_114|, |v_#memory_int_113|, v_dll_prepend_~data_17, |v_#memory_int_115|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_118| v_dll_prepend_~new_head~1.base_15))) (or (not (= |v_#memory_$Pointer$.base_118| (store |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_15 (store (store (store (select |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_15) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select .cse0 (_ bv0 32)))))) (not (= |v_#memory_int_114| (store |v_#memory_int_113| v_dll_prepend_~new_head~1.base_15 (store (store (select |v_#memory_int_113| v_dll_prepend_~new_head~1.base_15) (_ bv0 32) v_dll_prepend_~data_17) (_ bv4 32) (select (select |v_#memory_int_114| v_dll_prepend_~new_head~1.base_15) (_ bv4 32)))))) (not (= |v_#memory_int_115| (store |v_#memory_int_112| |main_~#s~0.base| (store (select |v_#memory_int_112| |main_~#s~0.base|) |main_~#s~0.offset| (select (select |v_#memory_int_115| |main_~#s~0.base|) |main_~#s~0.offset|))))) (not (= |v_#memory_int_112| (let ((.cse1 (select (select (store |v_#memory_$Pointer$.base_118| v_dll_prepend_~new_head~1.base_15 (store .cse0 (_ bv4 32) (select (select |v_#memory_$Pointer$.base_118| |main_~#s~0.base|) |main_~#s~0.offset|))) |main_~#s~0.base|) |main_~#s~0.offset|))) (store |v_#memory_int_114| .cse1 (let ((.cse2 (bvadd (select (select |v_#memory_$Pointer$.offset_100| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv8 32)))) (store (select |v_#memory_int_114| .cse1) .cse2 (select (select |v_#memory_int_112| .cse1) .cse2))))))) (not (= (select |#valid| v_dll_prepend_~new_head~1.base_15) (_ bv0 1))) (= v_dll_prepend_~data_17 (select (select |v_#memory_int_115| v_dll_prepend_~new_head~1.base_15) (_ bv0 32))))) [2018-11-23 11:16:41,963 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_21, v_prenex_20, v_dll_prepend_~new_head~1.base_15, v_DerPreprocessor_14]. (let ((.cse0 (= |main_~#s~0.offset| (_ bv0 32)))) (and (or .cse0 (not (= v_prenex_21 (select (select (store |#memory_$Pointer$.base| v_prenex_21 (store (store (store (select |#memory_$Pointer$.base| v_prenex_21) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_prenex_20)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_prenex_21) (_ bv0 1)))) (or (not .cse0) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1)))) (or (= v_dll_prepend_~new_head~1.base_15 |main_~#s~0.base|) (not (= v_dll_prepend_~new_head~1.base_15 (select (select (store |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_15 (store (store (store (select |#memory_$Pointer$.base| v_dll_prepend_~new_head~1.base_15) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_14)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_dll_prepend_~new_head~1.base_15) (_ bv0 1)))))) [2018-11-23 11:16:42,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:16:42,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 25 [2018-11-23 11:16:42,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-11-23 11:16:42,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:16:42,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:16:42,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:16:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:16:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:16:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=448, Unknown=4, NotChecked=180, Total=702 [2018-11-23 11:16:42,477 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 25 states.