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/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:48,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:48,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:48,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:48,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:48,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:48,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:48,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:48,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:48,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:48,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:48,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:48,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:48,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:48,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:48,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:48,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:48,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:48,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:48,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:48,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:48,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:48,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:48,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:48,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:48,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:48,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:48,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:48,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:48,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:48,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:48,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:48,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:48,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:48,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:48,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:48,594 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:15:48,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:48,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:48,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:48,611 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:48,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:48,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:48,612 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:48,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:48,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:48,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:48,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:48,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:48,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:48,613 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:48,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:48,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:48,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:48,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:48,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:48,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:48,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:48,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:48,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:48,616 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:48,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:48,616 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:48,617 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:48,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:48,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:48,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:48,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:48,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:48,684 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:48,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:48,747 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f306ec88/844b2bd5cc0b4a729224bf665291b322/FLAG257371b3f [2018-11-23 11:15:49,280 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:49,281 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:49,300 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f306ec88/844b2bd5cc0b4a729224bf665291b322/FLAG257371b3f [2018-11-23 11:15:49,549 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f306ec88/844b2bd5cc0b4a729224bf665291b322 [2018-11-23 11:15:49,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:49,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:49,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:49,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:49,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:49,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11eb5b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49, skipping insertion in model container [2018-11-23 11:15:49,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:49,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:50,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:50,105 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:50,173 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:50,356 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:50,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50 WrapperNode [2018-11-23 11:15:50,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:50,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:50,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:50,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:50,367 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:15:50" (1/1) ... [2018-11-23 11:15:50,387 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:15:50" (1/1) ... [2018-11-23 11:15:50,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:50,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:50,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:50,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:50,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (1/1) ... [2018-11-23 11:15:50,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:50,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:50,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:50,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:50,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (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:15:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:15:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:15:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:50,514 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:15:50,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:15:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:15:50,515 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:15:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:50,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:50,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-23 11:15:50,516 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-23 11:15:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:15:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:50,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:51,620 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:51,621 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:15:51,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:51 BoogieIcfgContainer [2018-11-23 11:15:51,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:51,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:51,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:51,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:51,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:49" (1/3) ... [2018-11-23 11:15:51,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3afbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:51, skipping insertion in model container [2018-11-23 11:15:51,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:50" (2/3) ... [2018-11-23 11:15:51,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3afbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:51, skipping insertion in model container [2018-11-23 11:15:51,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:51" (3/3) ... [2018-11-23 11:15:51,633 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:51,646 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:51,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:51,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:51,713 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:51,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:51,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:51,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:51,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:51,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:51,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:51,715 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:51,715 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:15:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:51,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:51,742 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:15:51,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:51,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1063381317, now seen corresponding path program 1 times [2018-11-23 11:15:51,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:51,755 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:15:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:51,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:52,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:15:52,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:15:52,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:52,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #119#return; {53#true} is VALID [2018-11-23 11:15:52,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret17 := main(); {53#true} is VALID [2018-11-23 11:15:52,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {53#true} is VALID [2018-11-23 11:15:52,085 INFO L256 TraceCheckUtils]: 6: Hoare triple {53#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {53#true} is VALID [2018-11-23 11:15:52,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {53#true} is VALID [2018-11-23 11:15:52,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#true} assume !~bvsgt32(~len, 0bv32); {53#true} is VALID [2018-11-23 11:15:52,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {53#true} is VALID [2018-11-23 11:15:52,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:52,087 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {53#true} {53#true} #109#return; {53#true} is VALID [2018-11-23 11:15:52,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#true} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {53#true} is VALID [2018-11-23 11:15:52,088 INFO L256 TraceCheckUtils]: 13: Hoare triple {53#true} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {53#true} is VALID [2018-11-23 11:15:52,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {53#true} is VALID [2018-11-23 11:15:52,089 INFO L256 TraceCheckUtils]: 15: Hoare triple {53#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {53#true} is VALID [2018-11-23 11:15:52,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {53#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {53#true} is VALID [2018-11-23 11:15:52,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {53#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {53#true} is VALID [2018-11-23 11:15:52,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {53#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {53#true} is VALID [2018-11-23 11:15:52,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:52,091 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {53#true} {53#true} #115#return; {53#true} is VALID [2018-11-23 11:15:52,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {53#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); {53#true} is VALID [2018-11-23 11:15:52,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {53#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); {53#true} is VALID [2018-11-23 11:15:52,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:52,092 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {53#true} {53#true} #111#return; {53#true} is VALID [2018-11-23 11:15:52,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {53#true} 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; {53#true} is VALID [2018-11-23 11:15:52,103 INFO L273 TraceCheckUtils]: 26: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 11:15:52,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {54#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {54#false} is VALID [2018-11-23 11:15:52,104 INFO L273 TraceCheckUtils]: 28: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:15:52,111 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:15:52,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:52,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:15:52,129 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:15:52,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:52,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:15:52,328 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:15:52,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:15:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:15:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:15:52,339 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:15:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,092 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2018-11-23 11:15:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:15:53,093 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:15:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:15:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-23 11:15:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:15:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-23 11:15:53,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 111 transitions. [2018-11-23 11:15:53,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:53,625 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:15:53,625 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:15:53,629 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:15:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:15:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:15:53,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:53,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:15:53,683 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:15:53,683 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:15:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,690 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:15:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 11:15:53,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,691 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:15:53,692 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:15:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,697 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:15:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 11:15:53,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:53,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:15:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 11:15:53,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-11-23 11:15:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:53,706 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 11:15:53,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:15:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 11:15:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:53,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:53,708 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:15:53,708 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:53,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:53,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1063389966, now seen corresponding path program 1 times [2018-11-23 11:15:53,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:53,710 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:15:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:54,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2018-11-23 11:15:54,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {389#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {389#true} is VALID [2018-11-23 11:15:54,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2018-11-23 11:15:54,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #119#return; {389#true} is VALID [2018-11-23 11:15:54,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {389#true} call #t~ret17 := main(); {389#true} is VALID [2018-11-23 11:15:54,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {409#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,262 INFO L256 TraceCheckUtils]: 6: Hoare triple {409#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {389#true} is VALID [2018-11-23 11:15:54,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {416#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:54,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,302 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {420#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {409#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #109#return; {390#false} is VALID [2018-11-23 11:15:54,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {390#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; {390#false} is VALID [2018-11-23 11:15:54,303 INFO L256 TraceCheckUtils]: 13: Hoare triple {390#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {390#false} is VALID [2018-11-23 11:15:54,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {390#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {390#false} is VALID [2018-11-23 11:15:54,303 INFO L256 TraceCheckUtils]: 15: Hoare triple {390#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {390#false} is VALID [2018-11-23 11:15:54,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {390#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {390#false} is VALID [2018-11-23 11:15:54,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {390#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {390#false} is VALID [2018-11-23 11:15:54,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {390#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {390#false} is VALID [2018-11-23 11:15:54,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {390#false} assume true; {390#false} is VALID [2018-11-23 11:15:54,305 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {390#false} {390#false} #115#return; {390#false} is VALID [2018-11-23 11:15:54,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {390#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); {390#false} is VALID [2018-11-23 11:15:54,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {390#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); {390#false} is VALID [2018-11-23 11:15:54,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {390#false} assume true; {390#false} is VALID [2018-11-23 11:15:54,306 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {390#false} {390#false} #111#return; {390#false} is VALID [2018-11-23 11:15:54,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {390#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; {390#false} is VALID [2018-11-23 11:15:54,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {390#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {390#false} is VALID [2018-11-23 11:15:54,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {390#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {390#false} is VALID [2018-11-23 11:15:54,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {390#false} assume !false; {390#false} is VALID [2018-11-23 11:15:54,310 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:15:54,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:54,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:15:54,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:54,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:54,400 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:15:54,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:54,401 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2018-11-23 11:15:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,994 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 11:15:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:54,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:15:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 11:15:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 11:15:55,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2018-11-23 11:15:55,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:55,213 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:15:55,213 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:15:55,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:15:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 11:15:55,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:55,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 11:15:55,240 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 11:15:55,240 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 11:15:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:55,243 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 11:15:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 11:15:55,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:55,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:55,245 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 11:15:55,245 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 11:15:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:55,249 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 11:15:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 11:15:55,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:55,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:55,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:55,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:15:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:15:55,254 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 29 [2018-11-23 11:15:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:55,254 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:15:55,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:15:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:15:55,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:55,256 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] [2018-11-23 11:15:55,257 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:55,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1468349973, now seen corresponding path program 1 times [2018-11-23 11:15:55,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:55,258 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:15:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:55,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:55,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2018-11-23 11:15:55,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {708#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {708#true} is VALID [2018-11-23 11:15:55,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {708#true} {708#true} #119#return; {708#true} is VALID [2018-11-23 11:15:55,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {708#true} call #t~ret17 := main(); {708#true} is VALID [2018-11-23 11:15:55,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {708#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {728#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:55,508 INFO L256 TraceCheckUtils]: 6: Hoare triple {728#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {708#true} is VALID [2018-11-23 11:15:55,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {708#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {735#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:55,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {735#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:55,509 INFO L256 TraceCheckUtils]: 9: Hoare triple {735#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {708#true} is VALID [2018-11-23 11:15:55,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {708#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {708#true} is VALID [2018-11-23 11:15:55,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {708#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {708#true} is VALID [2018-11-23 11:15:55,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {708#true} is VALID [2018-11-23 11:15:55,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,512 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {708#true} {735#(= |sll_create_#in~len| sll_create_~len)} #117#return; {735#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:55,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {735#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {735#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:55,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {735#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {763#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:15:55,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {763#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,547 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {728#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #109#return; {709#false} is VALID [2018-11-23 11:15:55,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {709#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; {709#false} is VALID [2018-11-23 11:15:55,548 INFO L256 TraceCheckUtils]: 22: Hoare triple {709#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {709#false} is VALID [2018-11-23 11:15:55,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {709#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {709#false} is VALID [2018-11-23 11:15:55,548 INFO L256 TraceCheckUtils]: 24: Hoare triple {709#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {709#false} is VALID [2018-11-23 11:15:55,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {709#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {709#false} is VALID [2018-11-23 11:15:55,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {709#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {709#false} is VALID [2018-11-23 11:15:55,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {709#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {709#false} is VALID [2018-11-23 11:15:55,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-23 11:15:55,550 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {709#false} {709#false} #115#return; {709#false} is VALID [2018-11-23 11:15:55,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {709#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); {709#false} is VALID [2018-11-23 11:15:55,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {709#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); {709#false} is VALID [2018-11-23 11:15:55,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-23 11:15:55,551 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {709#false} {709#false} #111#return; {709#false} is VALID [2018-11-23 11:15:55,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {709#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; {709#false} is VALID [2018-11-23 11:15:55,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {709#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {709#false} is VALID [2018-11-23 11:15:55,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {709#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {709#false} is VALID [2018-11-23 11:15:55,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {709#false} assume !false; {709#false} is VALID [2018-11-23 11:15:55,554 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:15:55,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:55,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {709#false} assume !false; {709#false} is VALID [2018-11-23 11:15:55,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {709#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {709#false} is VALID [2018-11-23 11:15:55,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {709#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {709#false} is VALID [2018-11-23 11:15:55,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {709#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; {709#false} is VALID [2018-11-23 11:15:55,889 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {708#true} {709#false} #111#return; {709#false} is VALID [2018-11-23 11:15:55,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {708#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); {708#true} is VALID [2018-11-23 11:15:55,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {708#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); {708#true} is VALID [2018-11-23 11:15:55,891 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {708#true} {708#true} #115#return; {708#true} is VALID [2018-11-23 11:15:55,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {708#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {708#true} is VALID [2018-11-23 11:15:55,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {708#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {708#true} is VALID [2018-11-23 11:15:55,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {708#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {708#true} is VALID [2018-11-23 11:15:55,892 INFO L256 TraceCheckUtils]: 24: Hoare triple {708#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {708#true} is VALID [2018-11-23 11:15:55,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {708#true} is VALID [2018-11-23 11:15:55,893 INFO L256 TraceCheckUtils]: 22: Hoare triple {709#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {708#true} is VALID [2018-11-23 11:15:55,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {709#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; {709#false} is VALID [2018-11-23 11:15:55,898 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {879#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #109#return; {709#false} is VALID [2018-11-23 11:15:55,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {892#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {767#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {892#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:15:55,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,905 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {708#true} {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #117#return; {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {708#true} is VALID [2018-11-23 11:15:55,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {708#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {708#true} is VALID [2018-11-23 11:15:55,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {708#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {708#true} is VALID [2018-11-23 11:15:55,907 INFO L256 TraceCheckUtils]: 9: Hoare triple {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {708#true} is VALID [2018-11-23 11:15:55,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {708#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {896#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,924 INFO L256 TraceCheckUtils]: 6: Hoare triple {879#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {708#true} is VALID [2018-11-23 11:15:55,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {708#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {879#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:55,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {708#true} call #t~ret17 := main(); {708#true} is VALID [2018-11-23 11:15:55,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {708#true} {708#true} #119#return; {708#true} is VALID [2018-11-23 11:15:55,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 11:15:55,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {708#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {708#true} is VALID [2018-11-23 11:15:55,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2018-11-23 11:15:55,930 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:15:55,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:55,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:55,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 11:15:55,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:55,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:56,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:56,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:56,080 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 9 states. [2018-11-23 11:15:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,251 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 11:15:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:15:57,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 11:15:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:57,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 11:15:57,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:57,508 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:15:57,509 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:15:57,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:15:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:15:57,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:57,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,553 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,553 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,558 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:15:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:15:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:57,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:57,560 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:15:57,560 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:15:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,564 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:15:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:15:57,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:57,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:57,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:57,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:15:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 11:15:57,569 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 38 [2018-11-23 11:15:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:57,569 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 11:15:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:15:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:15:57,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:57,572 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] [2018-11-23 11:15:57,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:57,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -339047342, now seen corresponding path program 2 times [2018-11-23 11:15:57,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:57,574 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:15:57,590 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:15:57,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:15:57,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:15:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:57,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:57,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:57,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:15:57,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:57,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-23 11:15:58,017 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:58,018 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_53|, sll_append_~new_last~0.base]. (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_53| |sll_append_#in~head.base| (store (select |v_#memory_$Pointer$.base_53| |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (not (= sll_append_~new_last~0.base (_ bv0 32)))) [2018-11-23 11:15:58,018 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) [2018-11-23 11:15:58,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:15:58,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:15:58,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:58,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 11:15:58,291 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:58,291 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (and (= .cse0 main_~ptr~0.base) (not (= (_ bv0 32) .cse0)))) [2018-11-23 11:15:58,291 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (_ bv0 32) main_~ptr~0.base)) [2018-11-23 11:15:58,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-23 11:15:58,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1194#true} is VALID [2018-11-23 11:15:58,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 11:15:58,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #119#return; {1194#true} is VALID [2018-11-23 11:15:58,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret17 := main(); {1194#true} is VALID [2018-11-23 11:15:58,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1214#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:15:58,326 INFO L256 TraceCheckUtils]: 6: Hoare triple {1214#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1194#true} is VALID [2018-11-23 11:15:58,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1194#true} is VALID [2018-11-23 11:15:58,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} assume !!~bvsgt32(~len, 0bv32); {1194#true} is VALID [2018-11-23 11:15:58,326 INFO L256 TraceCheckUtils]: 9: Hoare triple {1194#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1194#true} is VALID [2018-11-23 11:15:58,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {1194#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1194#true} is VALID [2018-11-23 11:15:58,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {1194#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1194#true} is VALID [2018-11-23 11:15:58,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {1194#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1194#true} is VALID [2018-11-23 11:15:58,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 11:15:58,327 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1194#true} {1194#true} #117#return; {1194#true} is VALID [2018-11-23 11:15:58,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1194#true} is VALID [2018-11-23 11:15:58,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1194#true} is VALID [2018-11-23 11:15:58,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {1194#true} assume !!~bvsgt32(~len, 0bv32); {1194#true} is VALID [2018-11-23 11:15:58,328 INFO L256 TraceCheckUtils]: 18: Hoare triple {1194#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1194#true} is VALID [2018-11-23 11:15:58,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {1194#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1194#true} is VALID [2018-11-23 11:15:58,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1194#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1194#true} is VALID [2018-11-23 11:15:58,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {1194#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1194#true} is VALID [2018-11-23 11:15:58,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 11:15:58,330 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1194#true} {1194#true} #117#return; {1194#true} is VALID [2018-11-23 11:15:58,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {1194#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1194#true} is VALID [2018-11-23 11:15:58,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {1194#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1194#true} is VALID [2018-11-23 11:15:58,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {1194#true} assume !~bvsgt32(~len, 0bv32); {1194#true} is VALID [2018-11-23 11:15:58,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {1194#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1194#true} is VALID [2018-11-23 11:15:58,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 11:15:58,333 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1194#true} {1214#(= |main_~#s~0.offset| (_ bv0 32))} #109#return; {1214#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:15:58,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {1214#(= |main_~#s~0.offset| (_ bv0 32))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {1214#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:15:58,335 INFO L256 TraceCheckUtils]: 31: Hoare triple {1214#(= |main_~#s~0.offset| (_ bv0 32))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1194#true} is VALID [2018-11-23 11:15:58,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1296#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-23 11:15:58,337 INFO L256 TraceCheckUtils]: 33: Hoare triple {1296#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1194#true} is VALID [2018-11-23 11:15:58,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {1194#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1303#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-23 11:15:58,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {1303#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1303#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-23 11:15:58,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {1303#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1310#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-23 11:15:58,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {1310#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1310#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-23 11:15:58,344 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1310#(not (= (_ bv0 32) |node_create_#res.base|))} {1296#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #115#return; {1317#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-23 11:15:58,345 INFO L273 TraceCheckUtils]: 39: Hoare triple {1317#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} ~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); {1321#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-23 11:15:58,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {1321#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} 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); {1325#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 11:15:58,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {1325#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {1325#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 11:15:58,350 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1325#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {1214#(= |main_~#s~0.offset| (_ bv0 32))} #111#return; {1332#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:15:58,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {1332#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} 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; {1336#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-23 11:15:58,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {1336#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1195#false} is VALID [2018-11-23 11:15:58,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {1195#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1195#false} is VALID [2018-11-23 11:15:58,352 INFO L273 TraceCheckUtils]: 46: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-23 11:15:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:15:58,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:58,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:58,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:15:58,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 11:15:58,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:58,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:15:58,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:58,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:15:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:15:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:58,458 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2018-11-23 11:15:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,839 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 11:15:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:15:59,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 11:15:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:15:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:15:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:15:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:15:59,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2018-11-23 11:15:59,971 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:15:59,973 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:15:59,974 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:15:59,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:15:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:16:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-23 11:16:00,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:16:00,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 46 states. [2018-11-23 11:16:00,029 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 46 states. [2018-11-23 11:16:00,029 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 46 states. [2018-11-23 11:16:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:16:00,033 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 11:16:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 11:16:00,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:16:00,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:16:00,035 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 54 states. [2018-11-23 11:16:00,035 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 54 states. [2018-11-23 11:16:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:16:00,039 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 11:16:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 11:16:00,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:16:00,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:16:00,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:16:00,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:16:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:16:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 11:16:00,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 47 [2018-11-23 11:16:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:16:00,044 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 11:16:00,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:16:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 11:16:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:16:00,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:16:00,046 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] [2018-11-23 11:16:00,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:16:00,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:16:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash -339045668, now seen corresponding path program 1 times [2018-11-23 11:16:00,047 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:16:00,047 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:16:00,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:16:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:00,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:00,307 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:16:00,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:16:00,321 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,321 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:16:00,321 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:16:02,437 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:16:05,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:05,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:05,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:05,095 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:16:05,275 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:16:05,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:05,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:05,330 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:16:05,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-23 11:16:05,338 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:05,338 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv1 1))) (= |#valid| (store .cse0 |main_#t~ret11.base| (_ bv1 1))) (= (_ bv0 1) (select .cse0 |main_#t~ret11.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|)) (= (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|) (_ bv0 1)))) [2018-11-23 11:16:05,339 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|)) (= |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 (= (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:16:12,649 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:16:14,827 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:16:14,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:14,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:14,905 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:16:14,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 11:16:14,956 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:14,957 WARN L384 uantifierElimination]: Input elimination task: ∃ [sll_append_~new_last~0.base, node_create_~temp~0.offset, |#memory_$Pointer$.base|]. (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) [2018-11-23 11:16:14,957 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_append_~new_last~0.base, node_create_~temp~0.offset, v_DerPreprocessor_2]. (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) [2018-11-23 11:16:19,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2018-11-23 11:16:19,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {1604#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1604#true} is VALID [2018-11-23 11:16:19,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2018-11-23 11:16:19,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #119#return; {1604#true} is VALID [2018-11-23 11:16:19,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret17 := main(); {1604#true} is VALID [2018-11-23 11:16:19,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1604#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1624#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:19,280 INFO L256 TraceCheckUtils]: 6: Hoare triple {1624#(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 := sll_create(~len~0, ~data~0); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:19,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:19,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:19,283 INFO L256 TraceCheckUtils]: 9: Hoare triple {1628#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:19,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1641#(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:16:19,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#(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); {1641#(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:16:19,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1641#(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:16:19,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#(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; {1641#(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:16:19,293 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1641#(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)))))} {1628#(= |#valid| |old(#valid)|)} #117#return; {1641#(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:16:19,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#(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~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1641#(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:16:19,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#(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)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1641#(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:16:19,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#(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); {1641#(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:16:19,295 INFO L256 TraceCheckUtils]: 18: Hoare triple {1641#(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~ret4.base, #t~ret4.offset := node_create(~data); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:19,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1669#(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:16:19,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(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); {1669#(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:16:19,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1676#(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:16:19,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {1676#(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; {1676#(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:16:19,307 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1676#(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|)))} {1641#(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)))))} #117#return; {1683#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:19,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {1683#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:19,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:19,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} assume !~bvsgt32(~len, 0bv32); {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:19,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:19,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} assume true; {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:19,358 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} {1624#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #109#return; {1704#(and (= |main_~#s~0.offset| (_ bv0 32)) (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:16:19,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {1704#(and (= |main_~#s~0.offset| (_ bv0 32)) (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; {1708#(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|)))) (= |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 (= (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:16:19,362 INFO L256 TraceCheckUtils]: 31: Hoare triple {1708#(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|)))) (= |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 (= (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 sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:19,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:19,363 INFO L256 TraceCheckUtils]: 33: Hoare triple {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:19,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1723#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:19,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {1723#(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); {1723#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:19,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {1723#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1730#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 11:16:19,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {1730#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1730#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 11:16:19,371 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1730#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #115#return; {1737#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) (_ bv0 1)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))))))} is VALID [2018-11-23 11:16:19,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {1737#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) (_ bv0 1)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))))))} ~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); {1741#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} is VALID [2018-11-23 11:16:19,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {1741#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} 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); {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-23 11:16:19,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} assume true; {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-23 11:16:19,381 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} {1708#(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|)))) (= |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 (= (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|))))} #111#return; {1605#false} is VALID [2018-11-23 11:16:19,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {1605#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; {1605#false} is VALID [2018-11-23 11:16:19,382 INFO L273 TraceCheckUtils]: 44: Hoare triple {1605#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1605#false} is VALID [2018-11-23 11:16:19,382 INFO L273 TraceCheckUtils]: 45: Hoare triple {1605#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {1605#false} is VALID [2018-11-23 11:16:19,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2018-11-23 11:16:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2018-11-23 11:16:19,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:20,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:20,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:20,063 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:16:20,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:16:20,097 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:20,098 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_sll_append_~new_last~0.base_9, v_node_create_~temp~0.offset_22, |v_#memory_$Pointer$.base_69|]. (or (not (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_69| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 1) (select |#valid| v_sll_append_~new_last~0.base_9))) (not (= |v_#memory_$Pointer$.base_69| (store |#memory_$Pointer$.base| v_sll_append_~new_last~0.base_9 (store (store (select |#memory_$Pointer$.base| v_sll_append_~new_last~0.base_9) (bvadd v_node_create_~temp~0.offset_22 (_ bv4 32)) (_ bv0 32)) v_node_create_~temp~0.offset_22 (select (select |v_#memory_$Pointer$.base_69| v_sll_append_~new_last~0.base_9) v_node_create_~temp~0.offset_22)))))) [2018-11-23 11:16:20,098 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_sll_append_~new_last~0.base_9, v_node_create_~temp~0.offset_22, v_DerPreprocessor_4]. (or (not (= (_ bv0 1) (select |#valid| v_sll_append_~new_last~0.base_9))) (not (= (select (select (store |#memory_$Pointer$.base| v_sll_append_~new_last~0.base_9 (store (store (select |#memory_$Pointer$.base| v_sll_append_~new_last~0.base_9) (bvadd v_node_create_~temp~0.offset_22 (_ bv4 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:16:21,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:16:21,240 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:16:21,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:16:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:21,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:21,403 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:16:21,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:21,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:21,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:16:21,412 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:21,412 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_71|]. (= (store |v_#valid_71| |main_~#s~0.base| (_ bv1 1)) |#valid|) [2018-11-23 11:16:21,412 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) [2018-11-23 11:16:21,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:21,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:21,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:21,899 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 27 treesize of output 44 [2018-11-23 11:16:21,944 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 32 treesize of output 36 [2018-11-23 11:16:21,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:21,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:21,986 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:16:21,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-11-23 11:16:21,996 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:21,996 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_39|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_old(#valid)_AFTER_CALL_39| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_39| |node_create_#t~malloc2.base|)) (= |#valid| (store .cse0 |main_#t~ret11.base| (_ bv1 1))) (= (bvadd (select |v_old(#valid)_AFTER_CALL_39| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)) (= (select .cse0 |main_#t~ret11.base|) (_ bv0 1)))) [2018-11-23 11:16:21,996 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:16:24,315 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 (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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:16:33,007 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:16:33,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:33,094 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:16:33,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 11:16:35,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:35,117 WARN L384 uantifierElimination]: Input elimination task: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, |#memory_$Pointer$.base|]. (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))) [2018-11-23 11:16:35,118 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_6]. (and (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))) [2018-11-23 11:16:35,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2018-11-23 11:16:35,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {1604#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1604#true} is VALID [2018-11-23 11:16:35,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2018-11-23 11:16:35,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #119#return; {1604#true} is VALID [2018-11-23 11:16:35,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret17 := main(); {1604#true} is VALID [2018-11-23 11:16:35,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {1604#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1795#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:35,342 INFO L256 TraceCheckUtils]: 6: Hoare triple {1795#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:35,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:35,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:35,344 INFO L256 TraceCheckUtils]: 9: Hoare triple {1628#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:35,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1641#(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:16:35,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#(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); {1641#(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:16:35,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1641#(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:16:35,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#(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; {1641#(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:16:35,348 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1641#(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)))))} {1628#(= |#valid| |old(#valid)|)} #117#return; {1641#(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:16:35,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#(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~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1641#(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:16:35,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#(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)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1641#(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:16:35,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#(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); {1641#(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:16:35,351 INFO L256 TraceCheckUtils]: 18: Hoare triple {1641#(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~ret4.base, #t~ret4.offset := node_create(~data); {1628#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:35,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {1628#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1669#(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:16:35,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(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); {1669#(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:16:35,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1676#(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:16:35,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {1676#(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; {1676#(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:16:35,359 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1676#(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|)))} {1641#(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)))))} #117#return; {1683#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:35,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {1683#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:35,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:35,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} assume !~bvsgt32(~len, 0bv32); {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} is VALID [2018-11-23 11:16:35,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {1687#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:35,385 INFO L273 TraceCheckUtils]: 28: Hoare triple {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} assume true; {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:35,391 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1697#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} {1795#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #109#return; {1868#(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:16:35,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {1868#(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; {1872#(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:16:35,394 INFO L256 TraceCheckUtils]: 31: Hoare triple {1872#(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 sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:35,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:35,395 INFO L256 TraceCheckUtils]: 33: Hoare triple {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:35,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {1712#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1723#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:35,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {1723#(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); {1723#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:35,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {1723#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1891#(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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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:16:35,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {1891#(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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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; {1891#(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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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:16:35,413 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1891#(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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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))))} {1716#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #115#return; {1898#(and (= sll_append_~head.base |sll_append_#in~head.base|) (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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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)))) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-23 11:16:35,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {1898#(and (= sll_append_~head.base |sll_append_#in~head.base|) (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 (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 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)))) (= sll_append_~head.offset |sll_append_#in~head.offset|))} ~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); {1741#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} is VALID [2018-11-23 11:16:35,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {1741#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} 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); {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-23 11:16:35,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} assume true; {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-23 11:16:35,424 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1745#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (sll_append_~new_last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32))))} {1872#(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|))))} #111#return; {1605#false} is VALID [2018-11-23 11:16:35,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {1605#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; {1605#false} is VALID [2018-11-23 11:16:35,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {1605#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1605#false} is VALID [2018-11-23 11:16:35,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {1605#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {1605#false} is VALID [2018-11-23 11:16:35,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2018-11-23 11:16:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-11-23 11:16:35,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:36,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:36,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:36,114 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:16:36,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:16:36,136 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:36,137 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_node_create_#t~malloc2.base_23|, v_node_create_~temp~0.offset_28, |v_#memory_$Pointer$.base_88|]. (or (not (= (select (select |v_#memory_$Pointer$.base_88| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_23|))) (not (= (store |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23| (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)) v_node_create_~temp~0.offset_28 (select (select |v_#memory_$Pointer$.base_88| |v_node_create_#t~malloc2.base_23|) v_node_create_~temp~0.offset_28))) |v_#memory_$Pointer$.base_88|))) [2018-11-23 11:16:36,137 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_node_create_#t~malloc2.base_23|, v_node_create_~temp~0.offset_28, v_DerPreprocessor_8]. (or (not (= (select (select (store |#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_23| (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)) v_node_create_~temp~0.offset_28 v_DerPreprocessor_8)) |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_23|)))) [2018-11-23 11:16:37,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:16:37,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-11-23 11:16:37,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-11-23 11:16:37,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:16:37,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:16:38,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:16:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:16:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:16:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=8, NotChecked=86, Total=600 [2018-11-23 11:16:38,055 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 24 states. [2018-11-23 11:17:32,098 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2018-11-23 11:18:43,152 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 28