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_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:51,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:51,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:51,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:51,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:51,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:51,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:51,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:51,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:51,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:51,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:51,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:51,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:51,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:51,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:51,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:51,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:51,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:51,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:51,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:51,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:51,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:51,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:51,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:51,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:51,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:51,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:51,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:51,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:51,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:51,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:51,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:51,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:51,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:51,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:51,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:51,493 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:51,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:51,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:51,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:51,509 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:51,510 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:51,510 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:51,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:51,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:51,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:51,512 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:51,512 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:51,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:51,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:51,512 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:51,513 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:51,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:51,513 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:51,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:51,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:51,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:51,514 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:51,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:51,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:51,514 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:51,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:51,515 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:51,515 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:51,515 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:51,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:51,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:51,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:51,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:51,585 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:51,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:51,646 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe7cfa8/b0422523655e4c9aa1cd06297ec71a3e/FLAG4dc9c9807 [2018-11-23 11:15:52,261 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:52,262 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:52,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe7cfa8/b0422523655e4c9aa1cd06297ec71a3e/FLAG4dc9c9807 [2018-11-23 11:15:52,479 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe7cfa8/b0422523655e4c9aa1cd06297ec71a3e [2018-11-23 11:15:52,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:52,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:52,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:52,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:52,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:52,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:52" (1/1) ... [2018-11-23 11:15:52,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235a3fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:52, skipping insertion in model container [2018-11-23 11:15:52,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:52" (1/1) ... [2018-11-23 11:15:52,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:52,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:52,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:52,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:53,116 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:53,195 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:53,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:53 WrapperNode [2018-11-23 11:15:53,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:53,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:53,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:53,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:53,207 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:53" (1/1) ... [2018-11-23 11:15:53,247 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:53" (1/1) ... [2018-11-23 11:15:53,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:53,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:53,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:53,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:53,276 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:53" (1/1) ... [2018-11-23 11:15:53,276 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:53" (1/1) ... [2018-11-23 11:15:53,281 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:53" (1/1) ... [2018-11-23 11:15:53,282 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:53" (1/1) ... [2018-11-23 11:15:53,303 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:53" (1/1) ... [2018-11-23 11:15:53,311 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:53" (1/1) ... [2018-11-23 11:15:53,315 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:53" (1/1) ... [2018-11-23 11:15:53,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:53,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:53,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:53,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:53,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:15:53,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:15:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:15:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:15:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:15:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:15:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:53,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:53,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-23 11:15:53,378 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-23 11:15:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:15:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:53,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:54,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:54,475 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:15:54,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:54 BoogieIcfgContainer [2018-11-23 11:15:54,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:54,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:54,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:54,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:54,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:52" (1/3) ... [2018-11-23 11:15:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1654e6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:54, skipping insertion in model container [2018-11-23 11:15:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:53" (2/3) ... [2018-11-23 11:15:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1654e6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:54, skipping insertion in model container [2018-11-23 11:15:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:54" (3/3) ... [2018-11-23 11:15:54,484 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:54,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:54,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:54,523 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:54,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:54,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:54,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:54,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:54,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:54,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:54,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:54,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:54,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 11:15:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:54,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:54,590 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:54,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:54,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1030430763, now seen corresponding path program 1 times [2018-11-23 11:15:54,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:54,604 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:54,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:55,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 11:15:55,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-23 11:15:55,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 11:15:55,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #132#return; {57#true} is VALID [2018-11-23 11:15:55,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret21 := main(); {57#true} is VALID [2018-11-23 11:15:55,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:55,325 INFO L256 TraceCheckUtils]: 6: Hoare triple {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-23 11:15:55,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {84#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:55,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {84#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:55,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:55,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:55,354 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #122#return; {58#false} is VALID [2018-11-23 11:15:55,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {58#false} is VALID [2018-11-23 11:15:55,355 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {58#false} is VALID [2018-11-23 11:15:55,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {58#false} is VALID [2018-11-23 11:15:55,355 INFO L256 TraceCheckUtils]: 15: Hoare triple {58#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {58#false} is VALID [2018-11-23 11:15:55,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {58#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; {58#false} is VALID [2018-11-23 11:15:55,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {58#false} is VALID [2018-11-23 11:15:55,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#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; {58#false} is VALID [2018-11-23 11:15:55,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-23 11:15:55,357 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {58#false} {58#false} #128#return; {58#false} is VALID [2018-11-23 11:15:55,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {58#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); {58#false} is VALID [2018-11-23 11:15:55,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#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); {58#false} is VALID [2018-11-23 11:15:55,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-23 11:15:55,358 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {58#false} {58#false} #124#return; {58#false} is VALID [2018-11-23 11:15:55,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {58#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {58#false} is VALID [2018-11-23 11:15:55,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {58#false} is VALID [2018-11-23 11:15:55,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {58#false} is VALID [2018-11-23 11:15:55,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 11:15:55,371 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:55,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:55,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:55,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:55,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:15:55,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:55,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:55,592 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:55,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:55,608 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 11:15:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,872 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2018-11-23 11:15:56,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:56,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:15:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 11:15:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 11:15:56,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-23 11:15:57,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:57,312 INFO L225 Difference]: With dead ends: 103 [2018-11-23 11:15:57,312 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:15:57,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:15:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:15:57,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:57,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,616 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,617 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:15:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,624 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 11:15:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 11:15:57,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:57,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:57,626 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:15:57,626 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:15:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,631 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 11:15:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 11:15:57,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:57,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:57,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:57,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:15:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 11:15:57,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2018-11-23 11:15:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:57,649 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 11:15:57,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 11:15:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:15:57,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:57,651 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:57,651 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:57,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1411828689, now seen corresponding path program 1 times [2018-11-23 11:15:57,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:57,653 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:57,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:57,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:57,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-23 11:15:57,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {437#true} is VALID [2018-11-23 11:15:57,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:57,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #132#return; {437#true} is VALID [2018-11-23 11:15:57,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret21 := main(); {437#true} is VALID [2018-11-23 11:15:57,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {457#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,959 INFO L256 TraceCheckUtils]: 6: Hoare triple {457#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {437#true} is VALID [2018-11-23 11:15:57,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {437#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {464#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:57,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {464#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {464#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:57,961 INFO L256 TraceCheckUtils]: 9: Hoare triple {464#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {437#true} is VALID [2018-11-23 11:15:57,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:57,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {437#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {437#true} is VALID [2018-11-23 11:15:57,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:57,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:57,963 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {437#true} {464#(= |sll_create_#in~len| sll_create_~len)} #130#return; {464#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:57,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#(= |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; {464#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:15:57,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {464#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {492#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:15:57,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {492#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:57,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:57,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:57,973 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {457#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #122#return; {438#false} is VALID [2018-11-23 11:15:57,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {438#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {438#false} is VALID [2018-11-23 11:15:57,974 INFO L256 TraceCheckUtils]: 22: Hoare triple {438#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {438#false} is VALID [2018-11-23 11:15:57,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {438#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {438#false} is VALID [2018-11-23 11:15:57,975 INFO L256 TraceCheckUtils]: 24: Hoare triple {438#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {438#false} is VALID [2018-11-23 11:15:57,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {438#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; {438#false} is VALID [2018-11-23 11:15:57,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {438#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {438#false} is VALID [2018-11-23 11:15:57,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {438#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; {438#false} is VALID [2018-11-23 11:15:57,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-23 11:15:57,977 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {438#false} {438#false} #128#return; {438#false} is VALID [2018-11-23 11:15:57,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {438#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); {438#false} is VALID [2018-11-23 11:15:57,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {438#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); {438#false} is VALID [2018-11-23 11:15:57,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-23 11:15:57,978 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {438#false} {438#false} #124#return; {438#false} is VALID [2018-11-23 11:15:57,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {438#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {438#false} is VALID [2018-11-23 11:15:57,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {438#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {438#false} is VALID [2018-11-23 11:15:57,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {438#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {438#false} is VALID [2018-11-23 11:15:57,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-23 11:15:57,983 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:57,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:58,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-23 11:15:58,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {438#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {438#false} is VALID [2018-11-23 11:15:58,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {438#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {438#false} is VALID [2018-11-23 11:15:58,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {438#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {438#false} is VALID [2018-11-23 11:15:58,416 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {437#true} {438#false} #124#return; {438#false} is VALID [2018-11-23 11:15:58,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:58,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {437#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); {437#true} is VALID [2018-11-23 11:15:58,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {437#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); {437#true} is VALID [2018-11-23 11:15:58,418 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {437#true} {437#true} #128#return; {437#true} is VALID [2018-11-23 11:15:58,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:58,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:58,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {437#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {437#true} is VALID [2018-11-23 11:15:58,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:58,420 INFO L256 TraceCheckUtils]: 24: Hoare triple {437#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {437#true} is VALID [2018-11-23 11:15:58,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {437#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {437#true} is VALID [2018-11-23 11:15:58,422 INFO L256 TraceCheckUtils]: 22: Hoare triple {438#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {437#true} is VALID [2018-11-23 11:15:58,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {438#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {438#false} is VALID [2018-11-23 11:15:58,432 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {608#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #122#return; {438#false} is VALID [2018-11-23 11:15:58,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:58,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:58,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {621#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {496#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:58,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {625#(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; {621#(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:58,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {625#(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; {625#(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:58,447 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {437#true} {625#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #130#return; {625#(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:58,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:58,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:58,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {437#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {437#true} is VALID [2018-11-23 11:15:58,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {437#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; {437#true} is VALID [2018-11-23 11:15:58,448 INFO L256 TraceCheckUtils]: 9: Hoare triple {625#(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); {437#true} is VALID [2018-11-23 11:15:58,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {625#(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); {625#(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:58,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {437#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {625#(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:58,452 INFO L256 TraceCheckUtils]: 6: Hoare triple {608#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {437#true} is VALID [2018-11-23 11:15:58,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {608#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret21 := main(); {437#true} is VALID [2018-11-23 11:15:58,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #132#return; {437#true} is VALID [2018-11-23 11:15:58,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:15:58,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {437#true} is VALID [2018-11-23 11:15:58,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-23 11:15:58,460 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:58,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:58,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:58,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 11:15:58,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:58,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:58,602 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:58,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:58,603 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 9 states. [2018-11-23 11:16:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:16:00,070 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-23 11:16:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:16:00,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 11:16:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:16:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:16:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2018-11-23 11:16:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:16:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2018-11-23 11:16:00,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2018-11-23 11:16:00,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:16:00,340 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:16:00,340 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:16:00,341 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:16:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:16:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 11:16:00,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:16:00,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 11:16:00,374 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 11:16:00,374 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 11:16:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:16:00,379 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:16:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 11:16:00,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:16:00,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:16:00,380 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 11:16:00,381 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 11:16:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:16:00,385 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:16:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 11:16:00,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:16:00,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:16:00,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:16:00,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:16:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:16:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-23 11:16:00,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 38 [2018-11-23 11:16:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:16:00,391 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-23 11:16:00,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:16:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 11:16:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:16:00,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:16:00,394 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,394 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:16:00,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:16:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash -656893099, now seen corresponding path program 2 times [2018-11-23 11:16:00,395 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:16:00,395 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:16:00,430 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:16:00,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:16:00,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:16:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:00,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:00,749 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,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,773 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,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:16:00,777 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,777 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,778 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,886 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:07,600 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:16:12,071 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:16:17,901 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:16:17,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:17,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:17,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-23 11:16:17,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:16:18,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,038 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:18,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-23 11:16:20,048 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:20,048 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv1 1))) (= |#valid| (store (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| (_ bv1 1)) |main_#t~ret11.base| (_ bv1 1))) (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:20,049 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|))) [2018-11-23 11:16:28,145 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:16:36,254 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:16:36,302 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,312 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,336 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,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 11:16:38,361 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:38,361 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:38,361 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:42,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2018-11-23 11:16:42,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {943#true} is VALID [2018-11-23 11:16:42,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2018-11-23 11:16:42,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #132#return; {943#true} is VALID [2018-11-23 11:16:42,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret21 := main(); {943#true} is VALID [2018-11-23 11:16:42,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {943#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {963#(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:42,884 INFO L256 TraceCheckUtils]: 6: Hoare triple {963#(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); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:42,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:42,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {967#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:42,886 INFO L256 TraceCheckUtils]: 9: Hoare triple {967#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:42,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {967#(= |#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; {980#(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:42,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#(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); {980#(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:42,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#(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; {980#(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:42,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#(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; {980#(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:42,897 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {980#(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)))))} {967#(= |#valid| |old(#valid)|)} #130#return; {980#(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:42,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#(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; {980#(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:42,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#(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; {980#(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:42,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#(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); {980#(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:42,923 INFO L256 TraceCheckUtils]: 18: Hoare triple {980#(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); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:42,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {967#(= |#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; {1008#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:16:42,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {1008#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1008#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:16:42,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {1008#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1015#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:16:42,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {1015#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1015#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-23 11:16:42,938 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1015#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {980#(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)))))} #130#return; {1022#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:42,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {1022#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |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; {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:16:42,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:16:42,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:16:42,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {1026#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1036#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:42,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {1036#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} assume true; {1036#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-23 11:16:42,979 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1036#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} {963#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #122#return; {1043#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} is VALID [2018-11-23 11:16:42,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {1043#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1047#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:16:42,982 INFO L256 TraceCheckUtils]: 31: Hoare triple {1047#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:42,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1055#(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:42,985 INFO L256 TraceCheckUtils]: 33: Hoare triple {1055#(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); {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:42,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {1051#(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; {1062#(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:42,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {1062#(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); {1062#(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:43,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {1062#(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; {1069#(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:43,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {1069#(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; {1069#(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:43,031 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1069#(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|)))} {1055#(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|))} #128#return; {1076#(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:43,037 INFO L273 TraceCheckUtils]: 39: Hoare triple {1076#(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); {1080#(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:43,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {1080#(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); {1084#(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:43,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {1084#(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; {1084#(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:43,042 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1084#(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))))} {1047#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #124#return; {944#false} is VALID [2018-11-23 11:16:43,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {944#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {944#false} is VALID [2018-11-23 11:16:43,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {944#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {944#false} is VALID [2018-11-23 11:16:43,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {944#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {944#false} is VALID [2018-11-23 11:16:43,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {944#false} assume !false; {944#false} is VALID [2018-11-23 11:16:43,061 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:43,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:43,421 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:16:43,747 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:43,760 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:43,783 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:43,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:16:43,808 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:43,809 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:43,809 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:47,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:16:47,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:16:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:16:47,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:16:47,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:16:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:47,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:47,611 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:47,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:47,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:47,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:16:47,621 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:47,621 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:47,622 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) [2018-11-23 11:17:03,301 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:17:10,485 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:17:10,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:10,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:10,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:10,553 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:17:10,572 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:17:10,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:10,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:10,710 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:17:10,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-11-23 11:17:10,719 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:10,719 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_29|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_old(#valid)_AFTER_CALL_29| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_29| |main_~#s~0.base|)) (= (store .cse0 |main_#t~ret11.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select .cse0 |main_#t~ret11.base|)) (not (= (_ bv0 32) |main_#t~ret11.base|)) (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_29| |node_create_#t~malloc2.base|)))) [2018-11-23 11:17:10,719 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:17:13,250 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:17:20,732 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:17:20,760 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:17:20,770 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:17:20,789 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:17:20,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 11:17:20,835 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:20,836 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:17:20,836 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:17:27,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2018-11-23 11:17:27,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {943#true} is VALID [2018-11-23 11:17:27,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2018-11-23 11:17:27,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #132#return; {943#true} is VALID [2018-11-23 11:17:27,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret21 := main(); {943#true} is VALID [2018-11-23 11:17:27,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {943#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1134#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:17:27,030 INFO L256 TraceCheckUtils]: 6: Hoare triple {1134#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:17:27,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:17:27,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {967#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:17:27,032 INFO L256 TraceCheckUtils]: 9: Hoare triple {967#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:17:27,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {967#(= |#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; {980#(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:17:27,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#(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); {980#(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:17:27,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#(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; {980#(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:17:27,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#(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; {980#(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:17:27,038 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {980#(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)))))} {967#(= |#valid| |old(#valid)|)} #130#return; {980#(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:17:27,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#(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; {980#(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:17:27,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#(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; {980#(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:17:27,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#(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); {980#(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:17:27,041 INFO L256 TraceCheckUtils]: 18: Hoare triple {980#(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); {967#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:17:27,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {967#(= |#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; {1177#(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:17:27,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#(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); {1177#(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:17:27,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {1177#(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; {1184#(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:17:27,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {1184#(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; {1184#(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:17:27,049 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1184#(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|)))} {980#(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)))))} #130#return; {1191#(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:17:27,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {1191#(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; {1195#(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:17:27,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {1195#(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; {1195#(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:17:27,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {1195#(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); {1195#(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:17:27,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {1195#(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; {1205#(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:17:27,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {1205#(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; {1205#(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:17:27,065 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1205#(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|)))} {1134#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #122#return; {1212#(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:17:27,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {1212#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (_ bv0 32) |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5bv32; {1216#(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:17:27,068 INFO L256 TraceCheckUtils]: 31: Hoare triple {1216#(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, ~uneq~0); {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:17:27,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1055#(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:17:27,070 INFO L256 TraceCheckUtils]: 33: Hoare triple {1055#(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); {1051#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:17:27,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {1051#(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; {1062#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:17:27,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {1062#(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); {1062#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:17:27,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {1062#(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; {1235#(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:17:27,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {1235#(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; {1235#(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:17:27,116 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1235#(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))))} {1055#(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|))} #128#return; {1242#(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:17:27,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {1242#(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); {1080#(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:17:27,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {1080#(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); {1084#(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:17:27,123 INFO L273 TraceCheckUtils]: 41: Hoare triple {1084#(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; {1084#(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:17:27,126 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1084#(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))))} {1216#(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|))))} #124#return; {944#false} is VALID [2018-11-23 11:17:27,127 INFO L273 TraceCheckUtils]: 43: Hoare triple {944#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {944#false} is VALID [2018-11-23 11:17:27,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {944#false} assume !(#t~mem13.base != 0bv32 || #t~mem13.offset != 0bv32);havoc #t~mem13.base, #t~mem13.offset; {944#false} is VALID [2018-11-23 11:17:27,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {944#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {944#false} is VALID [2018-11-23 11:17:27,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {944#false} assume !false; {944#false} is VALID [2018-11-23 11:17:27,137 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:17:27,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:17:27,528 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:17:27,725 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:17:27,770 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:17:27,814 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:17:27,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:17:30,087 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:30,088 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:17:30,088 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:17:34,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:17:34,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-11-23 11:17:34,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-11-23 11:17:34,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:34,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:17:34,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:34,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:17:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:17:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=666, Unknown=22, NotChecked=106, Total=870 [2018-11-23 11:17:34,543 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 29 states. [2018-11-23 11:18:58,660 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 49 DAG size of output: 29