java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:58:49,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:58:49,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:58:49,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:58:49,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:58:49,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:58:49,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:58:49,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:58:49,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:58:49,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:58:49,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:58:49,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:58:49,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:58:49,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:58:49,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:58:49,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:58:49,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:58:49,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:58:49,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:58:49,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:58:49,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:58:49,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:58:49,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:58:49,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:58:49,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:58:49,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:58:49,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:58:49,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:58:49,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:58:49,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:58:49,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:58:49,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:58:49,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:58:49,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:58:49,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:58:49,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:58:49,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:58:49,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:58:49,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:58:49,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:58:49,753 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:58:49,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:58:49,754 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:58:49,754 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:58:49,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:58:49,755 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:58:49,756 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:58:49,756 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:58:49,756 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:58:49,756 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:58:49,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:58:49,757 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:58:49,757 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:58:49,757 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:58:49,757 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:58:49,757 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:58:49,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:58:49,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:58:49,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:58:49,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:58:49,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:49,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:58:49,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:58:49,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:58:49,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:58:49,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:58:49,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:58:49,761 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:58:49,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:58:49,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:58:49,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:58:49,854 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:58:49,855 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:58:49,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:49,932 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/372a77ebd/6b28ae2f5e394cc784ec74be8fb8a8d4/FLAG787f2abea [2018-11-23 12:58:50,459 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:58:50,460 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:50,481 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/372a77ebd/6b28ae2f5e394cc784ec74be8fb8a8d4/FLAG787f2abea [2018-11-23 12:58:50,724 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/372a77ebd/6b28ae2f5e394cc784ec74be8fb8a8d4 [2018-11-23 12:58:50,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:58:50,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:58:50,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:50,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:58:50,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:58:50,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:50" (1/1) ... [2018-11-23 12:58:50,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea30ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:50, skipping insertion in model container [2018-11-23 12:58:50,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:50" (1/1) ... [2018-11-23 12:58:50,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:58:50,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:58:51,280 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:51,297 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:58:51,369 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:51,460 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:58:51,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51 WrapperNode [2018-11-23 12:58:51,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:51,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:51,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:58:51,463 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:58:51,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:51,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:58:51,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:58:51,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:58:51,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... [2018-11-23 12:58:51,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:58:51,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:58:51,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:58:51,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:58:51,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 12:58:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 12:58:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:58:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:58:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:58:51,712 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:58:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 12:58:51,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 12:58:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:58:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:58:51,713 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:58:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:58:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:58:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:58:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:58:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:58:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-23 12:58:51,715 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-23 12:58:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:58:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:58:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:58:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:58:51,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:58:52,713 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:58:52,713 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:58:52,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:52 BoogieIcfgContainer [2018-11-23 12:58:52,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:58:52,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:58:52,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:58:52,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:58:52,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:58:50" (1/3) ... [2018-11-23 12:58:52,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597b4cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:52, skipping insertion in model container [2018-11-23 12:58:52,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:51" (2/3) ... [2018-11-23 12:58:52,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597b4cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:52, skipping insertion in model container [2018-11-23 12:58:52,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:52" (3/3) ... [2018-11-23 12:58:52,722 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:52,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:58:52,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:58:52,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:58:52,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:58:52,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:58:52,793 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:58:52,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:58:52,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:58:52,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:58:52,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:58:52,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:58:52,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:58:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 12:58:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:58:52,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:52,822 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 12:58:52,824 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:52,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1063381317, now seen corresponding path program 1 times [2018-11-23 12:58:52,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:53,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 12:58:53,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53#true} is VALID [2018-11-23 12:58:53,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:58:53,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #119#return; {53#true} is VALID [2018-11-23 12:58:53,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret17 := main(); {53#true} is VALID [2018-11-23 12:58:53,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {53#true} is VALID [2018-11-23 12:58:53,118 INFO L256 TraceCheckUtils]: 6: Hoare triple {53#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {53#true} is VALID [2018-11-23 12:58:53,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {53#true} is VALID [2018-11-23 12:58:53,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#true} assume !(~len > 0); {53#true} is VALID [2018-11-23 12:58:53,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {53#true} is VALID [2018-11-23 12:58:53,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:58:53,120 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {53#true} {53#true} #109#return; {53#true} is VALID [2018-11-23 12:58:53,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#true} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {53#true} is VALID [2018-11-23 12:58:53,121 INFO L256 TraceCheckUtils]: 13: Hoare triple {53#true} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {53#true} is VALID [2018-11-23 12:58:53,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {53#true} is VALID [2018-11-23 12:58:53,122 INFO L256 TraceCheckUtils]: 15: Hoare triple {53#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {53#true} is VALID [2018-11-23 12:58:53,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {53#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {53#true} is VALID [2018-11-23 12:58:53,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {53#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {53#true} is VALID [2018-11-23 12:58:53,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {53#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {53#true} is VALID [2018-11-23 12:58:53,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:58:53,124 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {53#true} {53#true} #115#return; {53#true} is VALID [2018-11-23 12:58:53,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {53#true} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {53#true} is VALID [2018-11-23 12:58:53,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {53#true} assume 0 == #t~mem7.base && 0 == #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, 4); {53#true} is VALID [2018-11-23 12:58:53,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:58:53,125 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {53#true} {53#true} #111#return; {53#true} is VALID [2018-11-23 12:58:53,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {53#true} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {53#true} is VALID [2018-11-23 12:58:53,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 12:58:53,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {54#false} assume ~count~0 != 1 + ~len~0; {54#false} is VALID [2018-11-23 12:58:53,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 12:58:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:53,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:53,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:58:53,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 12:58:53,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:53,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:58:53,437 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 12:58:53,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:58:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:58:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:58:53,449 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 12:58:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:53,824 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2018-11-23 12:58:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:58:53,825 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 12:58:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:58:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-23 12:58:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:58:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-23 12:58:53,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 111 transitions. [2018-11-23 12:58:54,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:54,455 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:58:54,456 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:58:54,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:58:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:58:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:58:54,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:54,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:58:54,529 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:58:54,529 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:58:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:54,536 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:58:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:58:54,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:54,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:54,537 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:58:54,538 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:58:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:54,543 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:58:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:58:54,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:54,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:54,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:54,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:58:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 12:58:54,551 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-11-23 12:58:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:54,551 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 12:58:54,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:58:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:58:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:58:54,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:54,554 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 12:58:54,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:54,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1063389966, now seen corresponding path program 1 times [2018-11-23 12:58:54,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:54,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:54,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:55,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2018-11-23 12:58:55,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {305#true} is VALID [2018-11-23 12:58:55,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2018-11-23 12:58:55,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #119#return; {305#true} is VALID [2018-11-23 12:58:55,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret17 := main(); {305#true} is VALID [2018-11-23 12:58:55,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {305#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {305#true} is VALID [2018-11-23 12:58:55,020 INFO L256 TraceCheckUtils]: 6: Hoare triple {305#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {305#true} is VALID [2018-11-23 12:58:55,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {305#true} is VALID [2018-11-23 12:58:55,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#true} assume !(~len > 0); {305#true} is VALID [2018-11-23 12:58:55,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {305#true} is VALID [2018-11-23 12:58:55,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#true} assume true; {305#true} is VALID [2018-11-23 12:58:55,021 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {305#true} {305#true} #109#return; {305#true} is VALID [2018-11-23 12:58:55,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {305#true} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {305#true} is VALID [2018-11-23 12:58:55,022 INFO L256 TraceCheckUtils]: 13: Hoare triple {305#true} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {305#true} is VALID [2018-11-23 12:58:55,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {305#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {307#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:58:55,026 INFO L256 TraceCheckUtils]: 15: Hoare triple {307#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {305#true} is VALID [2018-11-23 12:58:55,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {305#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {308#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 12:58:55,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#(not (= 0 node_create_~temp~0.base))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {308#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 12:58:55,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#(not (= 0 node_create_~temp~0.base))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {309#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 12:58:55,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {309#(not (= 0 |node_create_#res.base|))} assume true; {309#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 12:58:55,042 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {309#(not (= 0 |node_create_#res.base|))} {307#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} #115#return; {310#(and (not (= 0 |sll_append_#t~ret6.base|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:58:55,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {310#(and (not (= 0 |sll_append_#t~ret6.base|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {311#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= 0 sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:58:55,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {311#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= 0 sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|))} assume 0 == #t~mem7.base && 0 == #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, 4); {312#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:58:55,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {312#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {312#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:58:55,066 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {312#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {305#true} #111#return; {313#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:58:55,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {313#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {314#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:58:55,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {314#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {306#false} is VALID [2018-11-23 12:58:55,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {306#false} assume ~count~0 != 1 + ~len~0; {306#false} is VALID [2018-11-23 12:58:55,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {306#false} assume !false; {306#false} is VALID [2018-11-23 12:58:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:55,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:55,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:58:55,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-23 12:58:55,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:55,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:58:55,126 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 12:58:55,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:58:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:58:55,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:58:55,127 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 10 states. [2018-11-23 12:58:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:55,861 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 12:58:55,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:58:55,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-23 12:58:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:58:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-23 12:58:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:58:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-23 12:58:55,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2018-11-23 12:58:56,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:56,013 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:58:56,014 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:58:56,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:58:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:58:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-23 12:58:56,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:56,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2018-11-23 12:58:56,054 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2018-11-23 12:58:56,054 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2018-11-23 12:58:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,063 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 12:58:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:58:56,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:56,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:56,064 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2018-11-23 12:58:56,065 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2018-11-23 12:58:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,069 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 12:58:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:58:56,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:56,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:56,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:56,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:58:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 12:58:56,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-23 12:58:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:56,076 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 12:58:56,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:58:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:58:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:58:56,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:56,079 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 12:58:56,080 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:56,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1063388292, now seen corresponding path program 1 times [2018-11-23 12:58:56,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:56,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:56,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:56,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2018-11-23 12:58:56,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {550#true} is VALID [2018-11-23 12:58:56,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:58:56,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #119#return; {550#true} is VALID [2018-11-23 12:58:56,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret17 := main(); {550#true} is VALID [2018-11-23 12:58:56,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {550#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {552#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:56,221 INFO L256 TraceCheckUtils]: 6: Hoare triple {552#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {550#true} is VALID [2018-11-23 12:58:56,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {550#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {553#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:56,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {553#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {554#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:56,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {554#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {554#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:56,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {554#(<= |sll_create_#in~len| 0)} assume true; {554#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:56,225 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {554#(<= |sll_create_#in~len| 0)} {552#(<= 2 main_~len~0)} #109#return; {551#false} is VALID [2018-11-23 12:58:56,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {551#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {551#false} is VALID [2018-11-23 12:58:56,226 INFO L256 TraceCheckUtils]: 13: Hoare triple {551#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {550#true} is VALID [2018-11-23 12:58:56,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {550#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {550#true} is VALID [2018-11-23 12:58:56,227 INFO L256 TraceCheckUtils]: 15: Hoare triple {550#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {550#true} is VALID [2018-11-23 12:58:56,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {550#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {550#true} is VALID [2018-11-23 12:58:56,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {550#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {550#true} is VALID [2018-11-23 12:58:56,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {550#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {550#true} is VALID [2018-11-23 12:58:56,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:58:56,228 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {550#true} {550#true} #115#return; {550#true} is VALID [2018-11-23 12:58:56,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {550#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, 4); {550#true} is VALID [2018-11-23 12:58:56,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {550#true} assume 0 == #t~mem7.base && 0 == #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, 4); {550#true} is VALID [2018-11-23 12:58:56,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:58:56,230 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {550#true} {551#false} #111#return; {551#false} is VALID [2018-11-23 12:58:56,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {551#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {551#false} is VALID [2018-11-23 12:58:56,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {551#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {551#false} is VALID [2018-11-23 12:58:56,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {551#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {551#false} is VALID [2018-11-23 12:58:56,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {551#false} assume !false; {551#false} is VALID [2018-11-23 12:58:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:58:56,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:58:56,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:56,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:58:56,284 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 12:58:56,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:58:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:58:56,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:58:56,285 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-23 12:58:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,545 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:58:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:58:56,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:58:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 12:58:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 12:58:56,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2018-11-23 12:58:56,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:56,765 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:58:56,765 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:58:56,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:58:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 12:58:56,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:56,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:56,803 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:56,803 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,807 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 12:58:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 12:58:56,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:56,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:56,809 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 12:58:56,809 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 12:58:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,812 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 12:58:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 12:58:56,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:56,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:56,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:56,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:58:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 12:58:56,819 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2018-11-23 12:58:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:56,819 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 12:58:56,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:58:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:58:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:58:56,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:56,824 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 12:58:56,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:56,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1468351647, now seen corresponding path program 1 times [2018-11-23 12:58:56,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:56,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:56,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:57,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 12:58:57,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {808#true} is VALID [2018-11-23 12:58:57,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #119#return; {808#true} is VALID [2018-11-23 12:58:57,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret17 := main(); {808#true} is VALID [2018-11-23 12:58:57,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {810#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:57,101 INFO L256 TraceCheckUtils]: 6: Hoare triple {810#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {808#true} is VALID [2018-11-23 12:58:57,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {808#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,104 INFO L256 TraceCheckUtils]: 9: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {808#true} is VALID [2018-11-23 12:58:57,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {808#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {808#true} is VALID [2018-11-23 12:58:57,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {808#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {808#true} is VALID [2018-11-23 12:58:57,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {808#true} is VALID [2018-11-23 12:58:57,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,112 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {808#true} {811#(<= |sll_create_#in~len| sll_create_~len)} #117#return; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {811#(<= |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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {812#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:58:57,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {812#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {813#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {813#(<= |sll_create_#in~len| 1)} assume true; {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,125 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {813#(<= |sll_create_#in~len| 1)} {810#(<= 2 main_~len~0)} #109#return; {809#false} is VALID [2018-11-23 12:58:57,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {809#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {809#false} is VALID [2018-11-23 12:58:57,126 INFO L256 TraceCheckUtils]: 22: Hoare triple {809#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {808#true} is VALID [2018-11-23 12:58:57,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {808#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {808#true} is VALID [2018-11-23 12:58:57,126 INFO L256 TraceCheckUtils]: 24: Hoare triple {808#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {808#true} is VALID [2018-11-23 12:58:57,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {808#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {808#true} is VALID [2018-11-23 12:58:57,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {808#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {808#true} is VALID [2018-11-23 12:58:57,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {808#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {808#true} is VALID [2018-11-23 12:58:57,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,127 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {808#true} {808#true} #115#return; {808#true} is VALID [2018-11-23 12:58:57,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {808#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, 4); {808#true} is VALID [2018-11-23 12:58:57,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {808#true} assume 0 == #t~mem7.base && 0 == #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, 4); {808#true} is VALID [2018-11-23 12:58:57,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,129 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {808#true} {809#false} #111#return; {809#false} is VALID [2018-11-23 12:58:57,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {809#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {809#false} is VALID [2018-11-23 12:58:57,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {809#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {809#false} is VALID [2018-11-23 12:58:57,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {809#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {809#false} is VALID [2018-11-23 12:58:57,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 12:58:57,133 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 12:58:57,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:57,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:58:57,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:57,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:57,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 12:58:57,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {808#true} is VALID [2018-11-23 12:58:57,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #119#return; {808#true} is VALID [2018-11-23 12:58:57,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret17 := main(); {808#true} is VALID [2018-11-23 12:58:57,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {810#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:57,613 INFO L256 TraceCheckUtils]: 6: Hoare triple {810#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {808#true} is VALID [2018-11-23 12:58:57,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {808#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,614 INFO L256 TraceCheckUtils]: 9: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {808#true} is VALID [2018-11-23 12:58:57,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {808#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {808#true} is VALID [2018-11-23 12:58:57,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {808#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {808#true} is VALID [2018-11-23 12:58:57,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {808#true} is VALID [2018-11-23 12:58:57,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:58:57,623 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {808#true} {811#(<= |sll_create_#in~len| sll_create_~len)} #117#return; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {811#(<= |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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {811#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:57,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {811#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {812#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:58:57,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {812#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {813#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {813#(<= |sll_create_#in~len| 1)} assume true; {813#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:58:57,628 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {813#(<= |sll_create_#in~len| 1)} {810#(<= 2 main_~len~0)} #109#return; {809#false} is VALID [2018-11-23 12:58:57,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {809#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {809#false} is VALID [2018-11-23 12:58:57,629 INFO L256 TraceCheckUtils]: 22: Hoare triple {809#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {809#false} is VALID [2018-11-23 12:58:57,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {809#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {809#false} is VALID [2018-11-23 12:58:57,630 INFO L256 TraceCheckUtils]: 24: Hoare triple {809#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {809#false} is VALID [2018-11-23 12:58:57,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {809#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {809#false} is VALID [2018-11-23 12:58:57,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {809#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {809#false} is VALID [2018-11-23 12:58:57,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {809#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {809#false} is VALID [2018-11-23 12:58:57,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {809#false} assume true; {809#false} is VALID [2018-11-23 12:58:57,631 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {809#false} {809#false} #115#return; {809#false} is VALID [2018-11-23 12:58:57,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {809#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, 4); {809#false} is VALID [2018-11-23 12:58:57,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {809#false} assume 0 == #t~mem7.base && 0 == #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, 4); {809#false} is VALID [2018-11-23 12:58:57,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {809#false} assume true; {809#false} is VALID [2018-11-23 12:58:57,632 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {809#false} {809#false} #111#return; {809#false} is VALID [2018-11-23 12:58:57,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {809#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {809#false} is VALID [2018-11-23 12:58:57,633 INFO L273 TraceCheckUtils]: 35: Hoare triple {809#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {809#false} is VALID [2018-11-23 12:58:57,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {809#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {809#false} is VALID [2018-11-23 12:58:57,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 12:58:57,636 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 12:58:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:58:57,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-23 12:58:57,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:57,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:58:57,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:57,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:58:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:58:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:57,811 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2018-11-23 12:58:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:58,303 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-23 12:58:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:58:58,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-23 12:58:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:58:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:58:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:58:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:58:58,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 12:58:58,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:58,543 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:58:58,543 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:58:58,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:58:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:58:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 12:58:58,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:58,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 12:58:58,581 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 12:58:58,581 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 12:58:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:58,584 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 12:58:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 12:58:58,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:58,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:58,586 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 12:58:58,586 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 12:58:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:58,590 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 12:58:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 12:58:58,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:58,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:58,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:58,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:58:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 12:58:58,594 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2018-11-23 12:58:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:58,594 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 12:58:58,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:58:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:58:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:58:58,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:58,596 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 12:58:58,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -339045668, now seen corresponding path program 2 times [2018-11-23 12:58:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:58,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 12:59:00,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1198#true} is VALID [2018-11-23 12:59:00,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 12:59:00,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #119#return; {1198#true} is VALID [2018-11-23 12:59:00,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret17 := main(); {1198#true} is VALID [2018-11-23 12:59:00,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1200#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:59:00,043 INFO L256 TraceCheckUtils]: 6: Hoare triple {1200#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:00,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:00,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {1201#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:00,045 INFO L256 TraceCheckUtils]: 9: Hoare triple {1201#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:00,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,054 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1201#(= |#valid| |old(#valid)|)} #117#return; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,063 INFO L256 TraceCheckUtils]: 18: Hoare triple {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:00,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1203#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1203#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {1203#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1204#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1204#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,074 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1204#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1202#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #117#return; {1205#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {1205#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:00,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:00,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} assume !(~len > 0); {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:00,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {1206#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1207#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {1207#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1207#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:00,092 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1207#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1200#(= (select |#valid| |main_~#s~0.base|) 1)} #109#return; {1208#(and (not (= 0 |main_#t~ret11.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:00,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {1208#(and (not (= 0 |main_#t~ret11.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {1209#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:00,095 INFO L256 TraceCheckUtils]: 31: Hoare triple {1209#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1210#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:00,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {1210#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1211#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} is VALID [2018-11-23 12:59:00,097 INFO L256 TraceCheckUtils]: 33: Hoare triple {1211#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1210#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:00,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {1210#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1212#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:00,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1212#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:00,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1213#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:00,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {1213#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {1213#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:00,110 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1213#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {1211#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} #115#return; {1214#(and (or (= 0 (select |old(#valid)| sll_append_~head.base)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:59:00,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {1214#(and (or (= 0 (select |old(#valid)| sll_append_~head.base)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1215#(and (or (= 0 (select |old(#valid)| sll_append_~head.base)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) |sll_append_#t~mem7.base|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:59:00,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {1215#(and (or (= 0 (select |old(#valid)| sll_append_~head.base)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) |sll_append_#t~mem7.base|) (= sll_append_~head.base |sll_append_#in~head.base|))} assume 0 == #t~mem7.base && 0 == #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, 4); {1216#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:59:00,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {1216#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {1216#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:59:00,113 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1216#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {1209#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #111#return; {1199#false} is VALID [2018-11-23 12:59:00,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {1199#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {1199#false} is VALID [2018-11-23 12:59:00,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {1199#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1199#false} is VALID [2018-11-23 12:59:00,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {1199#false} assume ~data~0 != #t~mem14;havoc #t~mem14; {1199#false} is VALID [2018-11-23 12:59:00,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 12:59:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:00,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:00,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:00,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:00,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:00,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 12:59:00,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:00,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:00,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 12:59:00,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:00,358 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= |#valid| (store |v_#valid_27| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0) (= main_~data~0 1)) [2018-11-23 12:59:00,358 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:59:03,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:03,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:03,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:03,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-23 12:59:03,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-11-23 12:59:04,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:04,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:34 [2018-11-23 12:59:04,037 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:04,038 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|, v_prenex_1]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| 1))) (and (= |#valid| (store .cse0 v_prenex_1 1)) (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) 1) (= 0 (select .cse0 v_prenex_1)) (= |main_~#s~0.offset| 0) (= 0 (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|)) (= main_~data~0 1))) [2018-11-23 12:59:04,038 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |node_create_#t~malloc2.base|]. (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (= |main_~#s~0.offset| 0) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1) (= 1 (select |#valid| |node_create_#t~malloc2.base|))) [2018-11-23 12:59:04,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:59:04,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:59:04,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 12:59:04,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:59:04,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:59:04,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:59:04,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:59:04,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 47 [2018-11-23 12:59:04,555 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 32 treesize of output 20 [2018-11-23 12:59:04,557 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2018-11-23 12:59:04,617 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 12:59:04,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:59:04,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:59:04,686 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:50, output treesize:50 [2018-11-23 12:59:04,690 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:04,690 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, sll_append_~new_last~0.base, |v_#memory_int_23|, sll_append_~new_last~0.offset, |v_#memory_$Pointer$.offset_29|]. (and (= (select (select |v_#memory_int_23| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| |sll_append_#in~head.base| (store (select |v_#memory_$Pointer$.base_29| |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= (store |v_#memory_$Pointer$.offset_29| |sll_append_#in~head.base| (store (select |v_#memory_$Pointer$.offset_29| |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)) (= (store |v_#memory_int_23| |sll_append_#in~head.base| (store (select |v_#memory_int_23| |sll_append_#in~head.base|) |sll_append_#in~head.offset| (select (select |#memory_int| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) |#memory_int|)) [2018-11-23 12:59:04,691 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (.cse2 (= (select |old(#valid)| .cse0) 0))) (or (and (= .cse0 |sll_append_#in~head.base|) (= .cse1 |sll_append_#in~head.offset|) .cse2) (and (= (select (select |#memory_int| .cse0) .cse1) |sll_append_#in~data|) .cse2)))) [2018-11-23 12:59:04,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:04,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:04,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:04,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:04,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2018-11-23 12:59:04,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:116, output treesize:30 [2018-11-23 12:59:04,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:04,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_2, v_prenex_4, v_prenex_3, |v_#valid_BEFORE_CALL_10|, v_prenex_1, |node_create_#t~malloc2.base|]. (let ((.cse2 (= |main_~#s~0.offset| 0)) (.cse3 (= main_~data~0 1)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (and (= main_~data~0 (select (select |#memory_int| .cse0) .cse1)) (not (= v_prenex_2 |main_~#s~0.base|)) (= 1 (select v_prenex_4 v_prenex_3)) (= (select v_prenex_4 v_prenex_2) 1) .cse2 (not (= |main_~#s~0.base| v_prenex_3)) (= 0 (select v_prenex_4 .cse0)) (= 1 (select v_prenex_4 |main_~#s~0.base|)) (not (= v_prenex_2 v_prenex_3)) .cse3) (and (= 1 (select |v_#valid_BEFORE_CALL_10| |main_~#s~0.base|)) (not (= |main_~#s~0.base| v_prenex_1)) .cse2 (= 1 (select |v_#valid_BEFORE_CALL_10| v_prenex_1)) (= (select |v_#valid_BEFORE_CALL_10| |node_create_#t~malloc2.base|) 1) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (= .cse0 |main_~#s~0.base|) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) .cse3 (= .cse1 |main_~#s~0.offset|) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse0))))) [2018-11-23 12:59:04,875 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= main_~data~0 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= .cse0 |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~data~0 1))) [2018-11-23 12:59:04,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 12:59:04,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 12:59:04,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 12:59:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 12:59:05,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:11 [2018-11-23 12:59:05,016 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:05,017 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (and (= .cse0 main_~ptr~0.base) (not (= |main_~#s~0.base| .cse0)) (= .cse1 main_~ptr~0.offset) (= main_~data~0 (select (select |#memory_int| .cse0) .cse1)) (= main_~data~0 1))) [2018-11-23 12:59:05,017 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)) (= main_~data~0 1)) [2018-11-23 12:59:05,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:59:05,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:59:05,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:05,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-11-23 12:59:05,094 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:05,095 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~ptr~0.base, main_~ptr~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset))) (and (= |main_#t~mem14| .cse0) (= main_~data~0 .cse0) (= main_~data~0 1))) [2018-11-23 12:59:05,095 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem14| main_~data~0) (= main_~data~0 1)) [2018-11-23 12:59:05,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 12:59:05,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1198#true} is VALID [2018-11-23 12:59:05,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 12:59:05,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #119#return; {1198#true} is VALID [2018-11-23 12:59:05,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret17 := main(); {1198#true} is VALID [2018-11-23 12:59:05,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1235#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:05,139 INFO L256 TraceCheckUtils]: 6: Hoare triple {1235#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {1201#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,140 INFO L256 TraceCheckUtils]: 9: Hoare triple {1201#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,144 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {1201#(= |#valid| |old(#valid)|)} #117#return; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !!(~len > 0); {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,147 INFO L256 TraceCheckUtils]: 18: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:05,173 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {1251#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #117#return; {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} assume !(~len > 0); {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} assume true; {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:05,192 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1291#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} {1235#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} #109#return; {1310#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:05,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {1310#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {1310#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:05,194 INFO L256 TraceCheckUtils]: 31: Hoare triple {1310#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1320#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data))} is VALID [2018-11-23 12:59:05,196 INFO L256 TraceCheckUtils]: 33: Hoare triple {1320#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1201#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:05,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {1201#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1327#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 12:59:05,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {1327#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1327#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 12:59:05,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {1327#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1334#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)))} is VALID [2018-11-23 12:59:05,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {1334#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)))} assume true; {1334#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)))} is VALID [2018-11-23 12:59:05,203 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1334#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)))} {1320#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data))} #115#return; {1341#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) 0))} is VALID [2018-11-23 12:59:05,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {1341#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) 0))} ~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, 4); {1345#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)))} is VALID [2018-11-23 12:59:05,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {1345#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)))} assume 0 == #t~mem7.base && 0 == #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, 4); {1349#(or (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.offset|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) |sll_append_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)))} is VALID [2018-11-23 12:59:05,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {1349#(or (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.offset|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) |sll_append_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)))} assume true; {1349#(or (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.offset|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) |sll_append_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)))} is VALID [2018-11-23 12:59:05,210 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1349#(or (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.offset|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) |sll_append_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)))} {1310#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} #111#return; {1356#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~data~0 1))} is VALID [2018-11-23 12:59:05,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {1356#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~data~0 1))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {1360#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)) (= main_~data~0 1))} is VALID [2018-11-23 12:59:05,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {1360#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)) (= main_~data~0 1))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1364#(and (= |main_#t~mem14| main_~data~0) (= main_~data~0 1))} is VALID [2018-11-23 12:59:05,219 INFO L273 TraceCheckUtils]: 45: Hoare triple {1364#(and (= |main_#t~mem14| main_~data~0) (= main_~data~0 1))} assume ~data~0 != #t~mem14;havoc #t~mem14; {1199#false} is VALID [2018-11-23 12:59:05,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 12:59:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:59:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2018-11-23 12:59:05,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-11-23 12:59:05,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:05,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:59:05,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:05,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:59:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:59:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=910, Unknown=4, NotChecked=0, Total=992 [2018-11-23 12:59:05,447 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 32 states. [2018-11-23 12:59:07,771 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-23 12:59:12,056 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-11-23 12:59:16,171 WARN L180 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-11-23 12:59:44,109 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-23 12:59:49,116 WARN L180 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-11-23 12:59:53,124 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 12:59:56,109 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-23 13:00:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:03,680 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2018-11-23 13:00:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:00:03,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-11-23 13:00:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:00:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 79 transitions. [2018-11-23 13:00:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:00:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 79 transitions. [2018-11-23 13:00:03,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 79 transitions. [2018-11-23 13:00:03,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:03,875 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:00:03,875 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:00:03,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=179, Invalid=1977, Unknown=6, NotChecked=0, Total=2162 [2018-11-23 13:00:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:00:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-11-23 13:00:03,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:03,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 55 states. [2018-11-23 13:00:03,948 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 55 states. [2018-11-23 13:00:03,948 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 55 states. [2018-11-23 13:00:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:03,952 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-23 13:00:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-11-23 13:00:03,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:03,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:03,953 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 62 states. [2018-11-23 13:00:03,953 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 62 states. [2018-11-23 13:00:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:03,957 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-23 13:00:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-11-23 13:00:03,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:03,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:03,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:03,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:00:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-23 13:00:03,964 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2018-11-23 13:00:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:03,964 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 13:00:03,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:00:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 13:00:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:00:03,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:03,967 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:03,967 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:03,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1227673137, now seen corresponding path program 1 times [2018-11-23 13:00:03,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:03,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:04,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:00:04,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1698#true} is VALID [2018-11-23 13:00:04,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:00:04,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1698#true} {1698#true} #119#return; {1698#true} is VALID [2018-11-23 13:00:04,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {1698#true} call #t~ret17 := main(); {1698#true} is VALID [2018-11-23 13:00:04,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {1698#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1700#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 13:00:04,601 INFO L256 TraceCheckUtils]: 6: Hoare triple {1700#(not (= 0 |main_~#s~0.base|))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1698#true} is VALID [2018-11-23 13:00:04,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {1698#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1698#true} is VALID [2018-11-23 13:00:04,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {1698#true} assume !!(~len > 0); {1698#true} is VALID [2018-11-23 13:00:04,602 INFO L256 TraceCheckUtils]: 9: Hoare triple {1698#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1698#true} is VALID [2018-11-23 13:00:04,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {1698#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1698#true} is VALID [2018-11-23 13:00:04,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {1698#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1698#true} is VALID [2018-11-23 13:00:04,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {1698#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1698#true} is VALID [2018-11-23 13:00:04,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:00:04,603 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1698#true} {1698#true} #117#return; {1698#true} is VALID [2018-11-23 13:00:04,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {1698#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1698#true} is VALID [2018-11-23 13:00:04,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1698#true} is VALID [2018-11-23 13:00:04,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {1698#true} assume !!(~len > 0); {1698#true} is VALID [2018-11-23 13:00:04,603 INFO L256 TraceCheckUtils]: 18: Hoare triple {1698#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1698#true} is VALID [2018-11-23 13:00:04,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {1698#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1698#true} is VALID [2018-11-23 13:00:04,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {1698#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1698#true} is VALID [2018-11-23 13:00:04,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {1698#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1698#true} is VALID [2018-11-23 13:00:04,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:00:04,604 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1698#true} {1698#true} #117#return; {1698#true} is VALID [2018-11-23 13:00:04,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {1698#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1698#true} is VALID [2018-11-23 13:00:04,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {1698#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1698#true} is VALID [2018-11-23 13:00:04,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {1698#true} assume !(~len > 0); {1698#true} is VALID [2018-11-23 13:00:04,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {1698#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1698#true} is VALID [2018-11-23 13:00:04,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:00:04,609 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1698#true} {1700#(not (= 0 |main_~#s~0.base|))} #109#return; {1700#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 13:00:04,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {1700#(not (= 0 |main_~#s~0.base|))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {1700#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 13:00:04,610 INFO L256 TraceCheckUtils]: 31: Hoare triple {1700#(not (= 0 |main_~#s~0.base|))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1698#true} is VALID [2018-11-23 13:00:04,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {1698#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1701#(and (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:04,611 INFO L256 TraceCheckUtils]: 33: Hoare triple {1701#(and (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1698#true} is VALID [2018-11-23 13:00:04,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {1698#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1702#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 13:00:04,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {1702#(not (= 0 node_create_~temp~0.base))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1702#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 13:00:04,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {1702#(not (= 0 node_create_~temp~0.base))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1703#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 13:00:04,612 INFO L273 TraceCheckUtils]: 37: Hoare triple {1703#(not (= 0 |node_create_#res.base|))} assume true; {1703#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 13:00:04,613 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1703#(not (= 0 |node_create_#res.base|))} {1701#(and (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} #115#return; {1704#(and (not (= 0 |sll_append_#t~ret6.base|)) (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:04,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {1704#(and (not (= 0 |sll_append_#t~ret6.base|)) (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1705#(and (= |sll_append_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset)) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset)) (not (= 0 sll_append_~new_last~0.base)) (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:04,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {1705#(and (= |sll_append_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset)) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset)) (not (= 0 sll_append_~new_last~0.base)) (= |sll_append_#in~head.offset| sll_append_~head.offset) (= sll_append_~head.base |sll_append_#in~head.base|))} assume !(0 == #t~mem7.base && 0 == #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} is VALID [2018-11-23 13:00:04,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4); {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} is VALID [2018-11-23 13:00:04,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} assume !(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem10.base, #t~mem10.offset; {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} is VALID [2018-11-23 13:00:04,619 INFO L273 TraceCheckUtils]: 43: Hoare triple {1706#(or (and (= |sll_append_#in~head.base| (select (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base) |sll_append_#in~head.offset|)) (= sll_append_~last~0.base |sll_append_#in~head.base|)) (not (= (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)) (not (= (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~last~0.base, 4 + ~last~0.offset, 4); {1707#(or (= |sll_append_#in~head.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} is VALID [2018-11-23 13:00:04,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {1707#(or (= |sll_append_#in~head.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} assume true; {1707#(or (= |sll_append_#in~head.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} is VALID [2018-11-23 13:00:04,622 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1707#(or (= |sll_append_#in~head.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0)))} {1700#(not (= 0 |main_~#s~0.base|))} #111#return; {1708#(or (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)))} is VALID [2018-11-23 13:00:04,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {1708#(or (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {1709#(or (not (= main_~ptr~0.offset 0)) (not (= 0 main_~ptr~0.base)))} is VALID [2018-11-23 13:00:04,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {1709#(or (not (= main_~ptr~0.offset 0)) (not (= 0 main_~ptr~0.base)))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1699#false} is VALID [2018-11-23 13:00:04,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {1699#false} assume ~count~0 != 1 + ~len~0; {1699#false} is VALID [2018-11-23 13:00:04,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:00:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 13:00:04,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:04,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:00:04,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-23 13:00:04,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:04,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:00:04,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:04,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:00:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:00:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:00:04,695 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 12 states. [2018-11-23 13:00:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:05,823 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 13:00:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:00:05,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-23 13:00:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:00:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-23 13:00:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:00:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-23 13:00:05,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2018-11-23 13:00:05,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:05,917 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:00:05,917 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:00:05,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:00:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:00:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-11-23 13:00:06,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:06,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 60 states. [2018-11-23 13:00:06,036 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 60 states. [2018-11-23 13:00:06,036 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 60 states. [2018-11-23 13:00:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:06,040 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 13:00:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-23 13:00:06,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:06,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:06,041 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 71 states. [2018-11-23 13:00:06,041 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 71 states. [2018-11-23 13:00:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:06,044 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 13:00:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-23 13:00:06,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:06,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:06,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:06,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:00:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-23 13:00:06,049 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 50 [2018-11-23 13:00:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:06,049 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-23 13:00:06,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:00:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 13:00:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:00:06,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:06,050 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:06,050 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:06,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1227674811, now seen corresponding path program 1 times [2018-11-23 13:00:06,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:06,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:08,026 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-23 13:00:08,315 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-11-23 13:00:08,875 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-11-23 13:00:09,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-23 13:00:09,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-23 13:00:09,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-23 13:00:09,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #119#return; {2052#true} is VALID [2018-11-23 13:00:09,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret17 := main(); {2052#true} is VALID [2018-11-23 13:00:09,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2054#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:00:09,220 INFO L256 TraceCheckUtils]: 6: Hoare triple {2054#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:09,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:00:09,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} assume !!(~len > 0); {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:00:09,223 INFO L256 TraceCheckUtils]: 9: Hoare triple {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:09,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,233 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2057#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} #117#return; {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,239 INFO L256 TraceCheckUtils]: 18: Hoare triple {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:09,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2059#(and (or (= (select |#valid| node_create_~temp~0.base) 1) (not (= node_create_~data 1))) (or (< 0 node_create_~data) (<= |node_create_#in~data| node_create_~data)) (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {2059#(and (or (= (select |#valid| node_create_~temp~0.base) 1) (not (= node_create_~data 1))) (or (< 0 node_create_~data) (<= |node_create_#in~data| node_create_~data)) (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2059#(and (or (= (select |#valid| node_create_~temp~0.base) 1) (not (= node_create_~data 1))) (or (< 0 node_create_~data) (<= |node_create_#in~data| node_create_~data)) (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {2059#(and (or (= (select |#valid| node_create_~temp~0.base) 1) (not (= node_create_~data 1))) (or (< 0 node_create_~data) (<= |node_create_#in~data| node_create_~data)) (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2060#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (or (and (= (select |#valid| |node_create_#res.base|) 1) (= (select (select |#memory_int| |node_create_#res.base|) 0) 1)) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {2060#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (or (and (= (select |#valid| |node_create_#res.base|) 1) (= (select (select |#memory_int| |node_create_#res.base|) 0) 1)) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {2060#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (or (and (= (select |#valid| |node_create_#res.base|) 1) (= (select (select |#memory_int| |node_create_#res.base|) 0) 1)) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,286 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2060#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (or (and (= (select |#valid| |node_create_#res.base|) 1) (= (select (select |#memory_int| |node_create_#res.base|) 0) 1)) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {2058#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #117#return; {2061#(and (= 0 |sll_create_#t~ret4.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) 1) (= (select |#valid| |sll_create_#t~ret4.base|) 1))) (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {2061#(and (= 0 |sll_create_#t~ret4.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) 1) (= (select |#valid| |sll_create_#t~ret4.base|) 1))) (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:09,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:09,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} assume !(~len > 0); {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:09,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {2062#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= sll_create_~head~0.offset 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~head~0.base) 0) 1))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2063#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (<= |sll_create_#res.offset| 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#res.base|) 0) 1) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {2063#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (<= |sll_create_#res.offset| 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#res.base|) 0) 1) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {2063#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (<= |sll_create_#res.offset| 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#res.base|) 0) 1) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:09,310 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2063#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (<= |sll_create_#res.offset| 0) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (and (= (select (select |#memory_int| |sll_create_#res.base|) 0) 1) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {2054#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} #109#return; {2064#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| |main_#t~ret11.base|) 0)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (<= |main_#t~ret11.offset| 0) (<= 0 |main_#t~ret11.offset|) (= (select |#valid| |main_#t~ret11.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:00:09,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {2064#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| |main_#t~ret11.base|) 0)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (<= |main_#t~ret11.offset| 0) (<= 0 |main_#t~ret11.offset|) (= (select |#valid| |main_#t~ret11.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {2065#(and (= 1 main_~data~0) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:00:09,312 INFO L256 TraceCheckUtils]: 31: Hoare triple {2065#(and (= 1 main_~data~0) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:09,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:09,315 INFO L256 TraceCheckUtils]: 33: Hoare triple {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:09,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:09,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:09,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2069#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} is VALID [2018-11-23 13:00:09,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {2069#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} assume true; {2069#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} is VALID [2018-11-23 13:00:09,327 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2069#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #115#return; {2070#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} is VALID [2018-11-23 13:00:09,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {2070#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} ~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, 4); {2070#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} is VALID [2018-11-23 13:00:09,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {2070#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|))) (= |#memory_int| |old(#memory_int)|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|))} assume !(0 == #t~mem7.base && 0 == #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} is VALID [2018-11-23 13:00:09,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4); {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} is VALID [2018-11-23 13:00:09,336 INFO L273 TraceCheckUtils]: 42: Hoare triple {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} assume !(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem10.base, #t~mem10.offset; {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} is VALID [2018-11-23 13:00:09,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {2071#(and (or (= sll_append_~last~0.base |sll_append_#in~head.base|) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= (select |old(#memory_int)| sll_append_~last~0.base) (select |#memory_int| sll_append_~last~0.base)) (= 0 (select |old(#valid)| sll_append_~last~0.base))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base)))} call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~last~0.base, 4 + ~last~0.offset, 4); {2072#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and (or (<= 1 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) 4) (<= (+ (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) 0) (= (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))) (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} is VALID [2018-11-23 13:00:09,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {2072#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and (or (<= 1 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) 4) (<= (+ (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) 0) (= (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))) (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} assume true; {2072#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and (or (<= 1 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) 4) (<= (+ (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) 0) (= (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))) (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} is VALID [2018-11-23 13:00:09,353 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2072#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and (or (<= 1 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) 4) (<= (+ (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) 0) (= (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))) (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} {2065#(and (= 1 main_~data~0) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #111#return; {2073#(and (= 1 main_~data~0) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:00:09,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {2073#(and (= 1 main_~data~0) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {2074#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} is VALID [2018-11-23 13:00:09,355 INFO L273 TraceCheckUtils]: 47: Hoare triple {2074#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {2075#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem14|))} is VALID [2018-11-23 13:00:09,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {2075#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem14|))} assume ~data~0 != #t~mem14;havoc #t~mem14; {2053#false} is VALID [2018-11-23 13:00:09,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-23 13:00:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:09,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:09,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:09,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:09,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:09,507 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 13:00:09,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:09,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:09,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 13:00:09,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:09,527 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_31|]. (and (= |#valid| (store |v_#valid_31| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0) (= main_~data~0 1)) [2018-11-23 13:00:09,527 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 13:00:10,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:00:10,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:00:10,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 13:00:10,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 13:00:10,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 13:00:10,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:10,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2018-11-23 13:00:10,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:10,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:10,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:10,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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 13:00:10,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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 13:00:10,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:10,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:11,018 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 13:00:11,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:51 [2018-11-23 13:00:13,024 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:13,024 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_16|, v_subst_1]. (let ((.cse0 (select (select |#memory_int| |main_#t~ret11.base|) 0)) (.cse1 (store |v_#valid_BEFORE_CALL_16| v_subst_1 1))) (and (<= .cse0 main_~data~0) (= (select .cse1 |main_#t~ret11.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| v_subst_1) 0) (= (select |v_#valid_BEFORE_CALL_16| |main_~#s~0.base|) 1) (= |main_~#s~0.offset| 0) (<= main_~data~0 .cse0) (= |main_#t~ret11.offset| 0) (= main_~data~0 1) (= |#valid| (store .cse1 |main_#t~ret11.base| 1)))) [2018-11-23 13:00:13,024 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1]. (let ((.cse0 (select (select |#memory_int| |main_#t~ret11.base|) 0))) (and (= 1 (select |#valid| v_subst_1)) (<= .cse0 main_~data~0) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (not (= |main_#t~ret11.base| v_subst_1)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 .cse0) (= |main_#t~ret11.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))) [2018-11-23 13:00:13,396 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 13:00:13,402 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 13:00:13,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:13,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:62 [2018-11-23 13:00:44,946 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 13:00:44,976 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 13:00:45,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:45,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:45,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:45,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:152, output treesize:268 [2018-11-23 13:00:47,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:47,130 WARN L384 uantifierElimination]: Input elimination task: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_2, node_create_~data, |v_#memory_$Pointer$.base_31|, sll_append_~last~0.offset, |v_#memory_$Pointer$.offset_31|, sll_append_~new_last~0.offset, sll_append_~new_last~0.base]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_31| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (.cse1 (+ sll_append_~last~0.offset 4)) (.cse3 (+ node_create_~temp~0.offset 4))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| .cse0 (store (select |v_#memory_$Pointer$.offset_31| .cse0) .cse1 sll_append_~new_last~0.offset))) (= (let ((.cse2 (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) .cse3 v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse1 (select (select |#memory_int| .cse0) .cse1)))) |#memory_int|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse3 0) node_create_~temp~0.offset (select (select |v_#memory_$Pointer$.offset_31| node_create_~temp~0.base) node_create_~temp~0.offset))) |v_#memory_$Pointer$.offset_31|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_31| .cse0 (store (select |v_#memory_$Pointer$.base_31| .cse0) .cse1 sll_append_~new_last~0.base))) (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse3 0) node_create_~temp~0.offset (select (select |v_#memory_$Pointer$.base_31| node_create_~temp~0.base) node_create_~temp~0.offset))) |v_#memory_$Pointer$.base_31|) (<= (select (select |v_#memory_$Pointer$.offset_31| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset))) [2018-11-23 13:00:47,130 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_4, v_DerPreprocessor_2, node_create_~data, sll_append_~last~0.offset, sll_append_~new_last~0.base, v_DerPreprocessor_6, sll_append_~new_last~0.offset]. (let ((.cse4 (+ node_create_~temp~0.offset 4))) (let ((.cse0 (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse4 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse5 (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse4 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse1 (select (select .cse0 |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (.cse2 (+ sll_append_~last~0.offset 4))) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 sll_append_~new_last~0.base))) (= (let ((.cse3 (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) .cse4 v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 (select (select |#memory_int| .cse1) .cse2)))) |#memory_int|) (<= (select (select .cse5 |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (= (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|))))) [2018-11-23 13:01:26,367 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 80 [2018-11-23 13:01:26,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 13:01:26,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 166 [2018-11-23 13:01:26,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:01:26,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:26,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 162 [2018-11-23 13:01:26,730 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 14 treesize of output 13 [2018-11-23 13:01:26,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2018-11-23 13:01:26,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:01:26,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:26,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,967 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 65 [2018-11-23 13:01:27,059 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 14 treesize of output 13 [2018-11-23 13:01:27,060 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,085 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,104 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 75 [2018-11-23 13:01:27,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:01:27,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:27,213 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,223 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2018-11-23 13:01:27,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-23 13:01:27,280 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,297 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,311 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,383 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 14 variables, input treesize:342, output treesize:74 [2018-11-23 13:01:27,418 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:27,419 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|, node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_4, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, v_DerPreprocessor_6, sll_append_~last~0.offset, sll_append_~new_last~0.offset, v_subst_1, |v_#valid_BEFORE_CALL_20|, sll_append_~new_last~0.base, |v_old(#memory_int)_AFTER_CALL_14|, v_DerPreprocessor_2, node_create_~data]. (let ((.cse6 (+ node_create_~temp~0.offset 4))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse4 (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| node_create_~temp~0.base (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| node_create_~temp~0.base) .cse6 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse0 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| node_create_~temp~0.base (store (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| node_create_~temp~0.base) .cse6 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse1 (select (select .cse4 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse2 (+ sll_append_~last~0.offset 4)) (.cse7 (select (select |v_old(#memory_int)_AFTER_CALL_14| .cse3) 0))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (not (= |main_~#s~0.base| .cse3)) (<= (select (select .cse0 |main_~#s~0.base|) |main_~#s~0.offset|) sll_append_~last~0.offset) (= (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 sll_append_~new_last~0.base)) |#memory_$Pointer$.base|) (= main_~data~0 1) (= (let ((.cse5 (store |v_old(#memory_int)_AFTER_CALL_14| node_create_~temp~0.base (store (store (select |v_old(#memory_int)_AFTER_CALL_14| node_create_~temp~0.base) .cse6 v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 (select (select |#memory_int| .cse1) .cse2)))) |#memory_int|) (<= .cse7 main_~data~0) (= (select |v_#valid_BEFORE_CALL_20| |main_~#s~0.base|) 1) (= |main_~#s~0.offset| 0) (= (select |v_#valid_BEFORE_CALL_20| v_subst_1) 1) (<= main_~data~0 .cse7) (= 0 (select |v_#valid_BEFORE_CALL_20| node_create_~temp~0.base)) (= 0 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= .cse3 v_subst_1)))))) [2018-11-23 13:01:27,419 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse2 (+ node_create_~temp~0.offset 4)) (.cse0 (select (select |#memory_int| .cse1) 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (<= .cse0 main_~data~0) (not (= .cse1 node_create_~temp~0.base)) (= (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) .cse2) 0) (not (= |main_~#s~0.base| node_create_~temp~0.base)) (not (= .cse1 |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) .cse2)) (<= main_~data~0 .cse0) (= main_~data~0 1)))) [2018-11-23 13:01:27,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-11-23 13:01:27,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-11-23 13:01:27,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 13:01:27,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 13:01:27,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:01:27,658 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 13:01:27,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,689 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:85, output treesize:21 [2018-11-23 13:01:27,693 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:27,694 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|, node_create_~temp~0.base, node_create_~temp~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (let ((.cse2 (select (select |#memory_int| .cse0) 0)) (.cse1 (+ node_create_~temp~0.offset 4)) (.cse3 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (and (= .cse0 main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) .cse1) 0) (<= .cse2 main_~data~0) (not (= |main_~#s~0.base| node_create_~temp~0.base)) (= .cse3 0) (<= main_~data~0 .cse2) (not (= |main_~#s~0.base| .cse0)) (not (= .cse0 node_create_~temp~0.base)) (= 0 (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) .cse1)) (= .cse3 main_~ptr~0.offset) (= main_~data~0 1)))) [2018-11-23 13:01:27,694 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) 0))) (and (<= main_~data~0 .cse0) (= main_~ptr~0.offset 0) (<= .cse0 main_~data~0) (= main_~data~0 1))) [2018-11-23 13:01:27,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 13:01:27,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 13:01:27,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-23 13:01:27,811 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:27,811 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~ptr~0.base]. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) 0))) (and (<= main_~data~0 .cse0) (= |main_#t~mem14| .cse0) (<= .cse0 main_~data~0) (= main_~data~0 1))) [2018-11-23 13:01:27,811 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~data~0 |main_#t~mem14|) (<= |main_#t~mem14| main_~data~0) (= main_~data~0 1)) [2018-11-23 13:01:27,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-23 13:01:27,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-23 13:01:27,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-23 13:01:27,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #119#return; {2052#true} is VALID [2018-11-23 13:01:27,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret17 := main(); {2052#true} is VALID [2018-11-23 13:01:27,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2094#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:01:27,861 INFO L256 TraceCheckUtils]: 6: Hoare triple {2094#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:27,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:27,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} assume !!(~len > 0); {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:27,862 INFO L256 TraceCheckUtils]: 9: Hoare triple {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:27,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2110#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} is VALID [2018-11-23 13:01:27,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {2110#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2110#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} is VALID [2018-11-23 13:01:27,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {2110#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2117#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 13:01:27,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {2117#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)))} assume true; {2117#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 13:01:27,867 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2117#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)))} {2056#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} #117#return; {2124#(and (<= sll_create_~data |sll_create_#in~data|) (= (select |old(#valid)| |sll_create_#t~ret4.base|) 0) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| |sll_create_#t~ret4.base| 1)))} is VALID [2018-11-23 13:01:27,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {2124#(and (<= sll_create_~data |sll_create_#in~data|) (= (select |old(#valid)| |sll_create_#t~ret4.base|) 0) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| |sll_create_#t~ret4.base| 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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:27,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:27,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} assume !!(~len > 0); {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:27,872 INFO L256 TraceCheckUtils]: 18: Hoare triple {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2055#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:27,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {2055#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2141#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} is VALID [2018-11-23 13:01:27,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2141#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} is VALID [2018-11-23 13:01:27,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2148#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| 0))} is VALID [2018-11-23 13:01:27,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {2148#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| 0))} assume true; {2148#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| 0))} is VALID [2018-11-23 13:01:27,879 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2148#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| 0))} {2128#(and (exists ((sll_create_~new_head~0.base Int)) (and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= (store |old(#valid)| sll_create_~new_head~0.base 1) |#valid|))) (<= sll_create_~data |sll_create_#in~data|) (<= |sll_create_#in~data| sll_create_~data))} #117#return; {2155#(and (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#t~ret4.base|) 0)) (<= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) |sll_create_#in~data|) (= 0 |sll_create_#t~ret4.offset|) (exists ((sll_create_~new_head~0.base Int)) (and (= (select (store |old(#valid)| sll_create_~new_head~0.base 1) |sll_create_#t~ret4.base|) 0) (= |#valid| (store (store |old(#valid)| sll_create_~new_head~0.base 1) |sll_create_#t~ret4.base| 1)) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)))))} is VALID [2018-11-23 13:01:27,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {2155#(and (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#t~ret4.base|) 0)) (<= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) |sll_create_#in~data|) (= 0 |sll_create_#t~ret4.offset|) (exists ((sll_create_~new_head~0.base Int)) (and (= (select (store |old(#valid)| sll_create_~new_head~0.base 1) |sll_create_#t~ret4.base|) 0) (= |#valid| (store (store |old(#valid)| sll_create_~new_head~0.base 1) |sll_create_#t~ret4.base| 1)) (= 0 (select |old(#valid)| sll_create_~new_head~0.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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} is VALID [2018-11-23 13:01:27,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} is VALID [2018-11-23 13:01:27,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} assume !(~len > 0); {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} is VALID [2018-11-23 13:01:27,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {2159#(and (<= (select (select |#memory_int| sll_create_~head~0.base) 0) |sll_create_#in~data|) (exists ((v_subst_1 Int)) (and (= 0 (select |old(#valid)| v_subst_1)) (= 0 (select (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) sll_create_~head~0.base 1)))) (= 0 sll_create_~head~0.offset) (<= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2169#(and (exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |sll_create_#res.base|)) (= 0 (select |old(#valid)| v_subst_1)) (= (store (store |old(#valid)| v_subst_1 1) |sll_create_#res.base| 1) |#valid|))) (= |sll_create_#res.offset| 0) (<= (select (select |#memory_int| |sll_create_#res.base|) 0) |sll_create_#in~data|) (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#res.base|) 0)))} is VALID [2018-11-23 13:01:27,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {2169#(and (exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |sll_create_#res.base|)) (= 0 (select |old(#valid)| v_subst_1)) (= (store (store |old(#valid)| v_subst_1 1) |sll_create_#res.base| 1) |#valid|))) (= |sll_create_#res.offset| 0) (<= (select (select |#memory_int| |sll_create_#res.base|) 0) |sll_create_#in~data|) (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#res.base|) 0)))} assume true; {2169#(and (exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |sll_create_#res.base|)) (= 0 (select |old(#valid)| v_subst_1)) (= (store (store |old(#valid)| v_subst_1 1) |sll_create_#res.base| 1) |#valid|))) (= |sll_create_#res.offset| 0) (<= (select (select |#memory_int| |sll_create_#res.base|) 0) |sll_create_#in~data|) (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#res.base|) 0)))} is VALID [2018-11-23 13:01:27,891 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2169#(and (exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |sll_create_#res.base|)) (= 0 (select |old(#valid)| v_subst_1)) (= (store (store |old(#valid)| v_subst_1 1) |sll_create_#res.base| 1) |#valid|))) (= |sll_create_#res.offset| 0) (<= (select (select |#memory_int| |sll_create_#res.base|) 0) |sll_create_#in~data|) (<= |sll_create_#in~data| (select (select |#memory_int| |sll_create_#res.base|) 0)))} {2094#(and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} #109#return; {2176#(and (<= (select (select |#memory_int| |main_#t~ret11.base|) 0) main_~data~0) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| |main_#t~ret11.base|) 0)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_#t~ret11.base| v_subst_1)))) (= |main_#t~ret11.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:01:27,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {2176#(and (<= (select (select |#memory_int| |main_#t~ret11.base|) 0) main_~data~0) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| |main_#t~ret11.base|) 0)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_#t~ret11.base| v_subst_1)))) (= |main_#t~ret11.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset; {2180#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:01:27,894 INFO L256 TraceCheckUtils]: 31: Hoare triple {2180#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:27,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:27,896 INFO L256 TraceCheckUtils]: 33: Hoare triple {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:27,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {2066#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:27,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:27,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {2068#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2199#(exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} is VALID [2018-11-23 13:01:27,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {2199#(exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} assume true; {2199#(exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} is VALID [2018-11-23 13:01:27,904 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2199#(exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} {2067#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #115#return; {2206#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:27,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {2206#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {2206#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:27,906 INFO L273 TraceCheckUtils]: 40: Hoare triple {2206#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} assume !(0 == #t~mem7.base && 0 == #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:01:27,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4); {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:01:27,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} assume !(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem10.base, #t~mem10.offset; {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:01:29,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#(and (<= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (exists ((node_create_~data Int) (node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= |#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) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~last~0.base, 4 + ~last~0.offset, 4); {2223#(exists ((node_create_~data Int) (sll_append_~last~0.offset Int) (sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base))) (= (store (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) (select (select |#memory_int| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4)))) |#memory_int|) (<= (select (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (= (store (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|)))} is UNKNOWN [2018-11-23 13:01:29,917 INFO L273 TraceCheckUtils]: 44: Hoare triple {2223#(exists ((node_create_~data Int) (sll_append_~last~0.offset Int) (sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base))) (= (store (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) (select (select |#memory_int| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4)))) |#memory_int|) (<= (select (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (= (store (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|)))} assume true; {2223#(exists ((node_create_~data Int) (sll_append_~last~0.offset Int) (sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base))) (= (store (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) (select (select |#memory_int| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4)))) |#memory_int|) (<= (select (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (= (store (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|)))} is VALID [2018-11-23 13:01:29,921 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2223#(exists ((node_create_~data Int) (sll_append_~last~0.offset Int) (sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base))) (= (store (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) (select (select |#memory_int| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4)))) |#memory_int|) (<= (select (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.offset) (= (store (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|)))} {2180#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))} #111#return; {2230#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) node_create_~temp~0.base)) (= (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4)) 0) (not (= |main_~#s~0.base| node_create_~temp~0.base)) (= 0 (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4))))) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (= main_~data~0 1))} is VALID [2018-11-23 13:01:29,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {2230#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) node_create_~temp~0.base)) (= (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4)) 0) (not (= |main_~#s~0.base| node_create_~temp~0.base)) (= 0 (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4))))) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)) (= main_~data~0 1))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0; {2234#(and (<= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) 0)) (= main_~ptr~0.offset 0) (<= (select (select |#memory_int| main_~ptr~0.base) 0) main_~data~0) (= main_~data~0 1))} is VALID [2018-11-23 13:01:29,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {2234#(and (<= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) 0)) (= main_~ptr~0.offset 0) (<= (select (select |#memory_int| main_~ptr~0.base) 0) main_~data~0) (= main_~data~0 1))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {2075#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem14|))} is VALID [2018-11-23 13:01:29,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {2075#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem14|))} assume ~data~0 != #t~mem14;havoc #t~mem14; {2053#false} is VALID [2018-11-23 13:01:29,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-23 13:01:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:01:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 42 [2018-11-23 13:01:29,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-11-23 13:01:29,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:29,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:01:34,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 84 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:34,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:01:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:01:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1548, Unknown=34, NotChecked=0, Total=1722 [2018-11-23 13:01:34,204 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 42 states. [2018-11-23 13:01:47,190 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 13:02:26,275 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 53