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_append_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:12:35,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:12:35,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:12:35,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:12:35,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:12:35,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:12:35,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:12:35,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:12:35,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:12:35,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:12:35,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:12:35,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:12:35,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:12:35,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:12:35,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:12:35,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:12:35,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:12:35,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:12:35,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:12:35,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:12:35,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:12:35,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:12:35,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:12:35,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:12:35,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:12:35,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:12:35,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:12:35,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:12:35,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:12:35,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:12:35,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:12:35,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:12:35,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:12:35,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:12:35,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:12:35,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:12:35,644 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:12:35,680 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:12:35,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:12:35,681 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:12:35,682 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:12:35,682 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:12:35,682 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:12:35,683 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:12:35,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:12:35,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:12:35,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:12:35,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:12:35,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:12:35,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:12:35,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:12:35,685 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:12:35,685 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:12:35,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:12:35,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:12:35,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:12:35,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:12:35,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:12:35,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:12:35,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:12:35,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:12:35,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:12:35,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:12:35,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:12:35,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:12:35,689 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:12:35,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:12:35,689 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:12:35,690 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:12:35,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:12:35,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:12:35,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:12:35,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:12:35,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:12:35,762 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:12:35,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:35,821 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea98b59/c5d18befbb9a432a9ba9f0cc824810cf/FLAG955d39820 [2018-11-23 11:12:36,359 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:12:36,360 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:36,373 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea98b59/c5d18befbb9a432a9ba9f0cc824810cf/FLAG955d39820 [2018-11-23 11:12:36,628 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea98b59/c5d18befbb9a432a9ba9f0cc824810cf [2018-11-23 11:12:36,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:12:36,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:12:36,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:36,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:12:36,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:12:36,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:36" (1/1) ... [2018-11-23 11:12:36,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5579612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:36, skipping insertion in model container [2018-11-23 11:12:36,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:36" (1/1) ... [2018-11-23 11:12:36,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:12:36,712 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:12:37,186 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:37,202 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:12:37,297 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:37,457 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:12:37,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37 WrapperNode [2018-11-23 11:12:37,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:37,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:37,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:12:37,459 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:12:37,469 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:12:37" (1/1) ... [2018-11-23 11:12:37,494 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:12:37" (1/1) ... [2018-11-23 11:12:37,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:37,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:12:37,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:12:37,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:12:37,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (1/1) ... [2018-11-23 11:12:37,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:12:37,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:12:37,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:12:37,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:12:37,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (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:12:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 11:12:37,641 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 11:12:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:12:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:12:37,642 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-11-23 11:12:37,642 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-11-23 11:12:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:12:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:12:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:12:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:12:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:12:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:12:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:12:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:12:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:12:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:12:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:12:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:12:37,645 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:12:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:12:37,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:12:38,770 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:12:38,770 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:12:38,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:38 BoogieIcfgContainer [2018-11-23 11:12:38,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:12:38,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:12:38,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:12:38,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:12:38,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:12:36" (1/3) ... [2018-11-23 11:12:38,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f8b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:38, skipping insertion in model container [2018-11-23 11:12:38,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:37" (2/3) ... [2018-11-23 11:12:38,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f8b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:38, skipping insertion in model container [2018-11-23 11:12:38,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:38" (3/3) ... [2018-11-23 11:12:38,780 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:38,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:12:38,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:12:38,816 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:12:38,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:12:38,849 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:12:38,849 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:12:38,849 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:12:38,849 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:12:38,849 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:12:38,849 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:12:38,850 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:12:38,850 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:12:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 11:12:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:12:38,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:38,876 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:12:38,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:38,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash -358902487, now seen corresponding path program 1 times [2018-11-23 11:12:38,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:38,891 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:12:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:39,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:39,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2018-11-23 11:12:39,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {58#true} is VALID [2018-11-23 11:12:39,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 11:12:39,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #138#return; {58#true} is VALID [2018-11-23 11:12:39,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret21 := main(); {58#true} is VALID [2018-11-23 11:12:39,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {58#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {58#true} is VALID [2018-11-23 11:12:39,287 INFO L256 TraceCheckUtils]: 6: Hoare triple {58#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {58#true} is VALID [2018-11-23 11:12:39,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {58#true} is VALID [2018-11-23 11:12:39,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#true} assume !true; {59#false} is VALID [2018-11-23 11:12:39,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {59#false} is VALID [2018-11-23 11:12:39,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#false} assume true; {59#false} is VALID [2018-11-23 11:12:39,304 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {59#false} {58#true} #128#return; {59#false} is VALID [2018-11-23 11:12:39,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {59#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {59#false} is VALID [2018-11-23 11:12:39,305 INFO L256 TraceCheckUtils]: 13: Hoare triple {59#false} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {59#false} is VALID [2018-11-23 11:12:39,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {59#false} is VALID [2018-11-23 11:12:39,306 INFO L256 TraceCheckUtils]: 15: Hoare triple {59#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {59#false} is VALID [2018-11-23 11:12:39,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {59#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; {59#false} is VALID [2018-11-23 11:12:39,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {59#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {59#false} is VALID [2018-11-23 11:12:39,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {59#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; {59#false} is VALID [2018-11-23 11:12:39,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {59#false} assume true; {59#false} is VALID [2018-11-23 11:12:39,308 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {59#false} {59#false} #136#return; {59#false} is VALID [2018-11-23 11:12:39,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {59#false} ~new_last~0.base, ~new_last~0.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); {59#false} is VALID [2018-11-23 11:12:39,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {59#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {59#false} is VALID [2018-11-23 11:12:39,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {59#false} assume true; {59#false} is VALID [2018-11-23 11:12:39,310 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {59#false} {59#false} #130#return; {59#false} is VALID [2018-11-23 11:12:39,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {59#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {59#false} is VALID [2018-11-23 11:12:39,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {59#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {59#false} is VALID [2018-11-23 11:12:39,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {59#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {59#false} is VALID [2018-11-23 11:12:39,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {59#false} assume !false; {59#false} is VALID [2018-11-23 11:12:39,323 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:12:39,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:39,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:39,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:12:39,338 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:12:39,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:39,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:12:39,543 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:12:39,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:12:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:12:39,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:12:39,559 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-23 11:12:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:40,025 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 11:12:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:12:40,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:12:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 125 transitions. [2018-11-23 11:12:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 125 transitions. [2018-11-23 11:12:40,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 125 transitions. [2018-11-23 11:12:41,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:41,079 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:12:41,079 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:12:41,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:12:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:12:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:12:41,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:41,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:12:41,156 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:12:41,156 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:12:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:41,162 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:12:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:12:41,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:41,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:41,164 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:12:41,164 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:12:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:41,169 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:12:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:12:41,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:41,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:41,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:41,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:12:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 11:12:41,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 29 [2018-11-23 11:12:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:41,177 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 11:12:41,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:12:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:12:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:12:41,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:41,179 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:12:41,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:41,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1188502940, now seen corresponding path program 1 times [2018-11-23 11:12:41,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:41,181 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:12:41,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:41,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:41,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {418#true} call ULTIMATE.init(); {418#true} is VALID [2018-11-23 11:12:41,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {418#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {418#true} is VALID [2018-11-23 11:12:41,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {418#true} assume true; {418#true} is VALID [2018-11-23 11:12:41,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} #138#return; {418#true} is VALID [2018-11-23 11:12:41,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {418#true} call #t~ret21 := main(); {418#true} is VALID [2018-11-23 11:12:41,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {418#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {438#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:41,473 INFO L256 TraceCheckUtils]: 6: Hoare triple {438#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {418#true} is VALID [2018-11-23 11:12:41,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {445#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:41,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {445#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:12:41,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:12:41,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:12:41,477 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {449#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {438#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #128#return; {419#false} is VALID [2018-11-23 11:12:41,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {419#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {419#false} is VALID [2018-11-23 11:12:41,478 INFO L256 TraceCheckUtils]: 13: Hoare triple {419#false} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {419#false} is VALID [2018-11-23 11:12:41,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {419#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {419#false} is VALID [2018-11-23 11:12:41,479 INFO L256 TraceCheckUtils]: 15: Hoare triple {419#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {419#false} is VALID [2018-11-23 11:12:41,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {419#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; {419#false} is VALID [2018-11-23 11:12:41,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {419#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {419#false} is VALID [2018-11-23 11:12:41,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {419#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; {419#false} is VALID [2018-11-23 11:12:41,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {419#false} assume true; {419#false} is VALID [2018-11-23 11:12:41,481 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {419#false} {419#false} #136#return; {419#false} is VALID [2018-11-23 11:12:41,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {419#false} ~new_last~0.base, ~new_last~0.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); {419#false} is VALID [2018-11-23 11:12:41,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {419#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {419#false} is VALID [2018-11-23 11:12:41,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {419#false} assume true; {419#false} is VALID [2018-11-23 11:12:41,482 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {419#false} {419#false} #130#return; {419#false} is VALID [2018-11-23 11:12:41,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {419#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {419#false} is VALID [2018-11-23 11:12:41,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {419#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {419#false} is VALID [2018-11-23 11:12:41,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {419#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {419#false} is VALID [2018-11-23 11:12:41,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {419#false} assume !false; {419#false} is VALID [2018-11-23 11:12:41,485 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:12:41,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:41,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:41,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:12:41,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:12:41,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:41,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:12:41,571 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:12:41,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:12:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:12:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:12:41,572 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2018-11-23 11:12:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:42,703 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-23 11:12:42,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:12:42,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:12:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:12:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:12:42,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 11:12:42,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:42,974 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:12:42,974 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:12:42,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:12:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:12:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 11:12:43,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:43,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 11:12:43,013 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 11:12:43,013 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 11:12:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:43,018 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 11:12:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 11:12:43,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:43,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:43,019 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 11:12:43,019 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 11:12:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:43,023 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 11:12:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 11:12:43,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:43,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:43,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:43,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:12:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 11:12:43,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 29 [2018-11-23 11:12:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:43,029 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 11:12:43,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:12:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:12:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:12:43,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:43,031 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:12:43,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:43,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1278937424, now seen corresponding path program 1 times [2018-11-23 11:12:43,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:43,032 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:12:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:43,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:43,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {764#true} is VALID [2018-11-23 11:12:43,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {764#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {764#true} is VALID [2018-11-23 11:12:43,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {764#true} assume true; {764#true} is VALID [2018-11-23 11:12:43,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {764#true} {764#true} #138#return; {764#true} is VALID [2018-11-23 11:12:43,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {764#true} call #t~ret21 := main(); {764#true} is VALID [2018-11-23 11:12:43,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {764#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {764#true} is VALID [2018-11-23 11:12:43,233 INFO L256 TraceCheckUtils]: 6: Hoare triple {764#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {764#true} is VALID [2018-11-23 11:12:43,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:12:43,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32); {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:12:43,243 INFO L256 TraceCheckUtils]: 9: Hoare triple {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {764#true} is VALID [2018-11-23 11:12:43,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {764#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; {764#true} is VALID [2018-11-23 11:12:43,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {764#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {764#true} is VALID [2018-11-23 11:12:43,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {764#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; {764#true} is VALID [2018-11-23 11:12:43,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {764#true} assume true; {764#true} is VALID [2018-11-23 11:12:43,245 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {764#true} {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} #134#return; {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:12:43,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:12:43,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {790#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} 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); {765#false} is VALID [2018-11-23 11:12:43,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {765#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; {765#false} is VALID [2018-11-23 11:12:43,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {765#false} assume !~bvsgt32(~len, 0bv32); {765#false} is VALID [2018-11-23 11:12:43,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {765#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {765#false} is VALID [2018-11-23 11:12:43,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {765#false} assume true; {765#false} is VALID [2018-11-23 11:12:43,250 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {765#false} {764#true} #128#return; {765#false} is VALID [2018-11-23 11:12:43,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {765#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {765#false} is VALID [2018-11-23 11:12:43,251 INFO L256 TraceCheckUtils]: 23: Hoare triple {765#false} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {765#false} is VALID [2018-11-23 11:12:43,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {765#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {765#false} is VALID [2018-11-23 11:12:43,252 INFO L256 TraceCheckUtils]: 25: Hoare triple {765#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {765#false} is VALID [2018-11-23 11:12:43,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {765#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; {765#false} is VALID [2018-11-23 11:12:43,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {765#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {765#false} is VALID [2018-11-23 11:12:43,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {765#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; {765#false} is VALID [2018-11-23 11:12:43,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {765#false} assume true; {765#false} is VALID [2018-11-23 11:12:43,253 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {765#false} {765#false} #136#return; {765#false} is VALID [2018-11-23 11:12:43,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {765#false} ~new_last~0.base, ~new_last~0.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); {765#false} is VALID [2018-11-23 11:12:43,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {765#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {765#false} is VALID [2018-11-23 11:12:43,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {765#false} assume true; {765#false} is VALID [2018-11-23 11:12:43,255 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {765#false} {765#false} #130#return; {765#false} is VALID [2018-11-23 11:12:43,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {765#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {765#false} is VALID [2018-11-23 11:12:43,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {765#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {765#false} is VALID [2018-11-23 11:12:43,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {765#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {765#false} is VALID [2018-11-23 11:12:43,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {765#false} assume !false; {765#false} is VALID [2018-11-23 11:12:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:12:43,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:12:43,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 11:12:43,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:43,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:12:43,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:43,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:12:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:12:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:12:43,342 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 3 states. [2018-11-23 11:12:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:43,853 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-23 11:12:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:12:43,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 11:12:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:12:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 11:12:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:12:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 11:12:43,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-23 11:12:44,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:44,074 INFO L225 Difference]: With dead ends: 81 [2018-11-23 11:12:44,074 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:12:44,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:12:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:12:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 11:12:44,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:44,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 11:12:44,143 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 11:12:44,144 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 11:12:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:44,147 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 11:12:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-23 11:12:44,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:44,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:44,149 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 11:12:44,149 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 11:12:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:44,152 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 11:12:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-23 11:12:44,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:44,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:44,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:44,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:12:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-23 11:12:44,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 39 [2018-11-23 11:12:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:44,160 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-23 11:12:44,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:12:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 11:12:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:12:44,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:44,167 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:12:44,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:44,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1210591538, now seen corresponding path program 1 times [2018-11-23 11:12:44,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:44,169 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:12:44,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:44,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:44,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:12:44,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1147#true} is VALID [2018-11-23 11:12:44,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #138#return; {1147#true} is VALID [2018-11-23 11:12:44,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret21 := main(); {1147#true} is VALID [2018-11-23 11:12:44,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1167#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:44,446 INFO L256 TraceCheckUtils]: 6: Hoare triple {1167#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1147#true} is VALID [2018-11-23 11:12:44,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1147#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1174#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32); {1174#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,451 INFO L256 TraceCheckUtils]: 9: Hoare triple {1174#(= dll_create_~len |dll_create_#in~len|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1147#true} is VALID [2018-11-23 11:12:44,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1147#true} is VALID [2018-11-23 11:12:44,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,453 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1147#true} {1174#(= dll_create_~len |dll_create_#in~len|)} #134#return; {1174#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {1174#(= dll_create_~len |dll_create_#in~len|)} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1174#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {1174#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1174#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {1174#(= 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; {1205#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:12:44,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {1205#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,463 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1167#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #128#return; {1148#false} is VALID [2018-11-23 11:12:44,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1148#false} is VALID [2018-11-23 11:12:44,463 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1148#false} is VALID [2018-11-23 11:12:44,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {1148#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1148#false} is VALID [2018-11-23 11:12:44,464 INFO L256 TraceCheckUtils]: 25: Hoare triple {1148#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1148#false} is VALID [2018-11-23 11:12:44,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {1148#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; {1148#false} is VALID [2018-11-23 11:12:44,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {1148#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1148#false} is VALID [2018-11-23 11:12:44,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {1148#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; {1148#false} is VALID [2018-11-23 11:12:44,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {1148#false} assume true; {1148#false} is VALID [2018-11-23 11:12:44,466 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1148#false} {1148#false} #136#return; {1148#false} is VALID [2018-11-23 11:12:44,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {1148#false} ~new_last~0.base, ~new_last~0.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); {1148#false} is VALID [2018-11-23 11:12:44,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {1148#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1148#false} is VALID [2018-11-23 11:12:44,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {1148#false} assume true; {1148#false} is VALID [2018-11-23 11:12:44,467 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1148#false} {1148#false} #130#return; {1148#false} is VALID [2018-11-23 11:12:44,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {1148#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1148#false} is VALID [2018-11-23 11:12:44,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {1148#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {1148#false} is VALID [2018-11-23 11:12:44,468 INFO L273 TraceCheckUtils]: 37: Hoare triple {1148#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1148#false} is VALID [2018-11-23 11:12:44,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:12:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:12:44,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:44,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:12:44,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {1148#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1148#false} is VALID [2018-11-23 11:12:44,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {1148#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {1148#false} is VALID [2018-11-23 11:12:44,903 INFO L273 TraceCheckUtils]: 35: Hoare triple {1148#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1148#false} is VALID [2018-11-23 11:12:44,903 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1147#true} {1148#false} #130#return; {1148#false} is VALID [2018-11-23 11:12:44,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {1147#true} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1147#true} is VALID [2018-11-23 11:12:44,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {1147#true} ~new_last~0.base, ~new_last~0.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); {1147#true} is VALID [2018-11-23 11:12:44,904 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1147#true} {1147#true} #136#return; {1147#true} is VALID [2018-11-23 11:12:44,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {1147#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1147#true} is VALID [2018-11-23 11:12:44,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,905 INFO L256 TraceCheckUtils]: 25: Hoare triple {1147#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1147#true} is VALID [2018-11-23 11:12:44,906 INFO L273 TraceCheckUtils]: 24: Hoare triple {1147#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1147#true} is VALID [2018-11-23 11:12:44,906 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1147#true} is VALID [2018-11-23 11:12:44,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1148#false} is VALID [2018-11-23 11:12:44,912 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1321#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #128#return; {1148#false} is VALID [2018-11-23 11:12:44,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {1334#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1209#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:44,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {1338#(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; {1334#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:12:44,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {1338#(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); {1338#(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:12:44,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {1338#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1338#(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:12:44,921 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1147#true} {1338#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} #134#return; {1338#(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:12:44,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1147#true} is VALID [2018-11-23 11:12:44,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#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; {1147#true} is VALID [2018-11-23 11:12:44,923 INFO L256 TraceCheckUtils]: 9: Hoare triple {1338#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1147#true} is VALID [2018-11-23 11:12:44,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {1338#(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); {1338#(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:12:44,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {1147#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1338#(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:12:44,927 INFO L256 TraceCheckUtils]: 6: Hoare triple {1321#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1147#true} is VALID [2018-11-23 11:12:44,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1321#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:44,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret21 := main(); {1147#true} is VALID [2018-11-23 11:12:44,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #138#return; {1147#true} is VALID [2018-11-23 11:12:44,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:12:44,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1147#true} is VALID [2018-11-23 11:12:44,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:12:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:12:44,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:44,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:12:44,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 11:12:44,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:44,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:12:45,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:45,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:12:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:12:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:45,132 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 9 states. [2018-11-23 11:12:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:46,924 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-23 11:12:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:12:46,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 11:12:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:12:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2018-11-23 11:12:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:12:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2018-11-23 11:12:46,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2018-11-23 11:12:47,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:47,149 INFO L225 Difference]: With dead ends: 81 [2018-11-23 11:12:47,149 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:12:47,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:12:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:12:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 11:12:47,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:47,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 48 states. [2018-11-23 11:12:47,184 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 48 states. [2018-11-23 11:12:47,184 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 48 states. [2018-11-23 11:12:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:47,188 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 11:12:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 11:12:47,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:47,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:47,189 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 52 states. [2018-11-23 11:12:47,189 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 52 states. [2018-11-23 11:12:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:47,192 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 11:12:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 11:12:47,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:47,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:47,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:47,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:12:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 11:12:47,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2018-11-23 11:12:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:47,197 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 11:12:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:12:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 11:12:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:12:47,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:47,199 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:12:47,199 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:47,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 361037510, now seen corresponding path program 1 times [2018-11-23 11:12:47,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:12:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:47,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:47,513 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:12:47,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:47,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:47,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:12:47,539 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:47,539 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_52|]. (and (= |#valid| (store |v_#valid_52| |main_~#s~0.base| (_ bv1 1))) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:12:47,540 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:12:49,635 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-23 11:12:51,897 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:12:56,224 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:13:00,202 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:13:01,781 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:13:01,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:01,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:01,976 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:13:02,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:13:02,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:02,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:02,046 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:13:02,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-23 11:13:04,069 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:04,069 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv1 1))) (= |#valid| (store (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| (_ bv1 1)) |main_#t~ret11.base| (_ bv1 1))) (= (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|))) [2018-11-23 11:13:04,069 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|))) [2018-11-23 11:13:04,634 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:13:08,986 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:13:13,228 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:13:13,306 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:13:13,319 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:13:13,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:13,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 11:13:15,368 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:15,368 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, dll_append_~new_last~0.base, node_create_~temp~0.offset]. (and (= (select (select |#memory_$Pointer$.base| |dll_append_#in~head.base|) |dll_append_#in~head.offset|) |dll_append_#t~mem7.base|) (= (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| dll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.base|) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))) [2018-11-23 11:13:15,368 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_append_~new_last~0.base, node_create_~temp~0.offset, v_DerPreprocessor_2]. (and (= |dll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|)) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))) [2018-11-23 11:13:17,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2018-11-23 11:13:17,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1670#true} is VALID [2018-11-23 11:13:17,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2018-11-23 11:13:17,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #138#return; {1670#true} is VALID [2018-11-23 11:13:17,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret21 := main(); {1670#true} is VALID [2018-11-23 11:13:17,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {1670#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1690#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:17,328 INFO L256 TraceCheckUtils]: 6: Hoare triple {1690#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:17,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:17,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {1694#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:17,330 INFO L256 TraceCheckUtils]: 9: Hoare triple {1694#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:17,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~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; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,334 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {1694#(= |#valid| |old(#valid)|)} #134#return; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:17,343 INFO L256 TraceCheckUtils]: 19: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:17,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~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; {1738#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:17,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {1738#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1738#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:17,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {1738#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1745#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:13:17,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {1745#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1745#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:13:17,349 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1745#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #134#return; {1752#(and (not (= |dll_create_#t~ret3.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base| (_ bv1 1))))))} is VALID [2018-11-23 11:13:17,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {1752#(and (not (= |dll_create_#t~ret3.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base| (_ bv1 1))))))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1756#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))) (not (= dll_create_~new_head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:13:17,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {1756#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))) (not (= dll_create_~new_head~0.base (_ bv0 32))))} 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); {1756#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))) (not (= dll_create_~new_head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:13:17,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {1756#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))) (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; {1763#(and (not (= (_ bv0 32) dll_create_~head~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))))))} is VALID [2018-11-23 11:13:17,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {1763#(and (not (= (_ bv0 32) dll_create_~head~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))))))} assume !~bvsgt32(~len, 0bv32); {1763#(and (not (= (_ bv0 32) dll_create_~head~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))))))} is VALID [2018-11-23 11:13:17,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {1763#(and (not (= (_ bv0 32) dll_create_~head~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1770#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:13:17,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {1770#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|))))} assume true; {1770#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:13:17,366 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1770#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|))))} {1690#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #128#return; {1777#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} is VALID [2018-11-23 11:13:17,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {1777#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1781#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:13:17,369 INFO L256 TraceCheckUtils]: 33: Hoare triple {1781#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:17,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} is VALID [2018-11-23 11:13:17,371 INFO L256 TraceCheckUtils]: 35: Hoare triple {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:17,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#(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; {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:13:17,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:13:19,379 INFO L273 TraceCheckUtils]: 38: Hoare triple {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1803#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.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_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} is UNKNOWN [2018-11-23 11:13:19,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {1803#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.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_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} assume true; {1803#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.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_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} is VALID [2018-11-23 11:13:19,386 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1803#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.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_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} #136#return; {1810#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_append_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_append_#t~ret6.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |dll_append_#t~ret6.base|) node_create_~temp~0.offset))))) (= (select |old(#valid)| |dll_append_#t~ret6.base|) (_ bv0 1)) (= dll_append_~head.base |dll_append_#in~head.base|))} is VALID [2018-11-23 11:13:19,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {1810#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_append_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_append_#t~ret6.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |dll_append_#t~ret6.base|) node_create_~temp~0.offset))))) (= (select |old(#valid)| |dll_append_#t~ret6.base|) (_ bv0 1)) (= dll_append_~head.base |dll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.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); {1814#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |dll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|)) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:13:19,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {1814#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |dll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|)) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} is VALID [2018-11-23 11:13:19,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} assume true; {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} is VALID [2018-11-23 11:13:19,398 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} {1781#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #130#return; {1671#false} is VALID [2018-11-23 11:13:19,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {1671#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1671#false} is VALID [2018-11-23 11:13:19,399 INFO L273 TraceCheckUtils]: 46: Hoare triple {1671#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {1671#false} is VALID [2018-11-23 11:13:19,399 INFO L273 TraceCheckUtils]: 47: Hoare triple {1671#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1671#false} is VALID [2018-11-23 11:13:19,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2018-11-23 11:13:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2018-11-23 11:13:19,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:13:19,856 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:13:20,227 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:13:20,238 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:13:20,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:20,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-11-23 11:13:22,283 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:22,283 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_dll_append_~new_last~0.base_9, v_node_create_~temp~0.offset_22, |v_#memory_$Pointer$.base_75|]. (or (not (= (_ bv0 1) (select |#valid| v_dll_append_~new_last~0.base_9))) (not (= |v_#memory_$Pointer$.base_75| (store |#memory_$Pointer$.base| v_dll_append_~new_last~0.base_9 (store (store (store (select |#memory_$Pointer$.base| v_dll_append_~new_last~0.base_9) (bvadd v_node_create_~temp~0.offset_22 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_22 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_22 (select (select |v_#memory_$Pointer$.base_75| v_dll_append_~new_last~0.base_9) v_node_create_~temp~0.offset_22))))) (not (= (select (select |v_#memory_$Pointer$.base_75| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)))) [2018-11-23 11:13:22,283 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_dll_append_~new_last~0.base_9, v_node_create_~temp~0.offset_22, v_DerPreprocessor_4]. (or (not (= (_ bv0 1) (select |#valid| v_dll_append_~new_last~0.base_9))) (not (= (select (select (store |#memory_$Pointer$.base| v_dll_append_~new_last~0.base_9 (store (store (store (select |#memory_$Pointer$.base| v_dll_append_~new_last~0.base_9) (bvadd v_node_create_~temp~0.offset_22 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_22 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_22 v_DerPreprocessor_4)) |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)))) [2018-11-23 11:13:24,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:13:24,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:13:24,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:13:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:24,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:13:24,689 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:13:24,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:24,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:24,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:13:24,696 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:24,696 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_71|]. (= (store |v_#valid_71| |main_~#s~0.base| (_ bv1 1)) |#valid|) [2018-11-23 11:13:24,697 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) [2018-11-23 11:13:36,116 WARN L180 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:13:36,820 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:13:45,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:45,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:45,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:45,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-23 11:13:45,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-23 11:13:45,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:45,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:45,238 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:13:45,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-11-23 11:13:47,248 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:47,248 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_38|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_old(#valid)_AFTER_CALL_38| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= |#valid| (store .cse0 |main_#t~ret11.base| (_ bv1 1))) (= (select |v_old(#valid)_AFTER_CALL_38| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |main_#t~ret11.base|)) (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_38| |main_~#s~0.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|)))) [2018-11-23 11:13:47,248 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (= (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|))) [2018-11-23 11:13:49,639 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-11-23 11:13:54,586 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:13:54,665 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:13:54,676 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:13:54,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:54,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 11:13:56,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:56,722 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, node_create_~temp~0.base, node_create_~temp~0.offset]. (and (= (select (select |#memory_$Pointer$.base| |dll_append_#in~head.base|) |dll_append_#in~head.offset|) |dll_append_#t~mem7.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))) [2018-11-23 11:13:56,722 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_6]. (and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_6)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|) |dll_append_#t~mem7.base|)) [2018-11-23 11:13:59,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2018-11-23 11:13:59,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1670#true} is VALID [2018-11-23 11:13:59,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2018-11-23 11:13:59,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #138#return; {1670#true} is VALID [2018-11-23 11:13:59,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret21 := main(); {1670#true} is VALID [2018-11-23 11:13:59,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {1670#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1868#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:13:59,037 INFO L256 TraceCheckUtils]: 6: Hoare triple {1868#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:59,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:59,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1694#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:59,038 INFO L256 TraceCheckUtils]: 9: Hoare triple {1694#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:59,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~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; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,042 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {1694#(= |#valid| |old(#valid)|)} #134#return; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:13:59,045 INFO L256 TraceCheckUtils]: 19: Hoare triple {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1694#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:59,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {1694#(= |#valid| |old(#valid)|)} ~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; {1914#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:59,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {1914#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1914#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:59,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {1914#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1921#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:13:59,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {1921#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1921#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:13:59,053 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1921#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} {1707#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #134#return; {1928#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base|)))) (not (= |dll_create_#t~ret3.base| (_ bv0 32))))} is VALID [2018-11-23 11:13:59,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {1928#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#t~ret3.base|)))) (not (= |dll_create_#t~ret3.base| (_ bv0 32))))} ~new_head~0.base, ~new_head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;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); {1932#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:13:59,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {1932#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))))} 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); {1932#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:13:59,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {1932#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |#valid|))))} ~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; {1939#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-23 11:13:59,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {1939#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {1939#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-23 11:13:59,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {1939#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~head~0.base)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1946#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base|)))))} is VALID [2018-11-23 11:13:59,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {1946#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base|)))))} assume true; {1946#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base|)))))} is VALID [2018-11-23 11:13:59,075 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1946#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |dll_create_#res.base|)))))} {1868#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #128#return; {1953#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (_ bv0 32) |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)))} is VALID [2018-11-23 11:13:59,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {1953#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (_ bv0 32) |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1957#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:13:59,091 INFO L256 TraceCheckUtils]: 33: Hoare triple {1957#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:59,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} is VALID [2018-11-23 11:13:59,093 INFO L256 TraceCheckUtils]: 35: Hoare triple {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1785#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:59,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#(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; {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:13:59,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:14:01,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {1796#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~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; {1976#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is UNKNOWN [2018-11-23 11:14:01,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {1976#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {1976#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-23 11:14:01,103 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1976#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {1789#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_append_~head.base |dll_append_#in~head.base|))} #136#return; {1983#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))) (= dll_append_~head.base |dll_append_#in~head.base|))} is VALID [2018-11-23 11:14:01,108 INFO L273 TraceCheckUtils]: 41: Hoare triple {1983#(and (= dll_append_~head.offset |dll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))) (= dll_append_~head.base |dll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.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); {1814#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |dll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|)) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:14:01,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {1814#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |dll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|)) (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1))))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} is VALID [2018-11-23 11:14:01,112 INFO L273 TraceCheckUtils]: 43: Hoare triple {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} assume true; {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} is VALID [2018-11-23 11:14:01,117 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1818#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |dll_append_#in~head.base|) |dll_append_#in~head.offset|))))} {1957#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #130#return; {1671#false} is VALID [2018-11-23 11:14:01,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {1671#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1671#false} is VALID [2018-11-23 11:14:01,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {1671#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {1671#false} is VALID [2018-11-23 11:14:01,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {1671#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1671#false} is VALID [2018-11-23 11:14:01,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2018-11-23 11:14:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2018-11-23 11:14:01,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:14:01,566 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:14:01,846 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:14:01,858 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:14:01,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:01,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-11-23 11:14:01,940 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:01,940 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_node_create_#t~malloc2.base_23|, v_node_create_~temp~0.offset_28, |v_#memory_$Pointer$.base_94|]. (or (not (= (select (select |v_#memory_$Pointer$.base_94| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_23|))) (not (= |v_#memory_$Pointer$.base_94| (store |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23| (store (store (store (select |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23|) (bvadd v_node_create_~temp~0.offset_28 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_28 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_28 (select (select |v_#memory_$Pointer$.base_94| |v_node_create_#t~malloc2.base_23|) v_node_create_~temp~0.offset_28)))))) [2018-11-23 11:14:01,940 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_node_create_#t~malloc2.base_23|, v_node_create_~temp~0.offset_28, v_DerPreprocessor_8]. (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_23|))) (not (= (select (select (store |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23| (store (store (store (select |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23|) (bvadd v_node_create_~temp~0.offset_28 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_28 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_28 v_DerPreprocessor_8)) |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)))) [2018-11-23 11:14:02,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:14:02,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-11-23 11:14:02,746 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-11-23 11:14:02,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:02,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:14:03,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:03,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:14:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:14:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=784, Unknown=13, NotChecked=114, Total=992 [2018-11-23 11:14:03,072 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 31 states. [2018-11-23 11:15:20,234 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 53 DAG size of output: 32